A classification of nilpotent 3-BCI groups
Hiroki Koike, Istv\'an Kov\'acs

TL;DR
This paper classifies finite nilpotent groups that ensure all bi-Cayley graphs of valency up to 3 are BCI-graphs, revealing a specific structural characterization involving homocyclic groups and certain 2-groups.
Contribution
It provides a complete characterization of nilpotent 3-BCI-groups, identifying their precise algebraic structure.
Findings
Finite nilpotent groups are 3-BCI if and only if they are of the form U × V with specified properties.
The groups U are homocyclic of odd order, V is trivial or one of the specified 2-groups.
This classification extends understanding of symmetry properties of bi-Cayley graphs.
Abstract
Given a finite group and a subset the bi-Cayley graph is the graph whose vertex set is and edge set is . A bi-Cayley graph is called a BCI-graph if for any bi-Cayley graph implies that for some and . A group is called an -BCI-group if all bi-Cayley graphs of of valency at most are BCI-graphs.In this paper we prove that, a finite nilpotent group is a 3-BCI-group if and only if it is in the form where is a homocyclic group of odd order, and is trivial or one of the groups and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems
