A classification of nilpotent 3-BCI groups

From MaRDI portal
(Redirected from Publication:5124323)




Abstract: Given a finite group G and a subset SsubseteqG, the bi-Cayley graph is the graph whose vertex set is Gimes0,1 and edge set is (x,0),(sx,1):xinG,sinS. A bi-Cayley graph is called a BCI-graph if for any bi-Cayley graph implies that T=gSalpha for some ginG and alphainaut(G). A group G is called an m-BCI-group if all bi-Cayley graphs of G of valency at most m 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 UimesV, where U is a homocyclic group of odd order, and V is trivial or one of the groups and Q8.











This page was built for publication: A classification of nilpotent 3-BCI groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124323)