English

A classification of nilpotent 3-BCI groups

Group Theory 2013-09-02 v1 Combinatorics

Abstract

Given a finite group GG and a subset SG,S\subseteq G, the bi-Cayley graph \bcay(G,S)\bcay(G,S) is the graph whose vertex set is G×{0,1}G \times \{0,1\} and edge set is {{(x,0),(sx,1)}:xG,sS}\{\{(x,0),(s x,1)\} : x \in G, s\in S \}. A bi-Cayley graph \bcay(G,S)\bcay(G,S) is called a BCI-graph if for any bi-Cayley graph \bcay(G,T),\bcay(G,T), \bcay(G,S)\bcay(G,T)\bcay(G,S) \cong \bcay(G,T) implies that T=gSαT = g S^\alpha for some gGg \in G and α\aut(G)\alpha \in \aut(G). A group GG is called an mm-BCI-group if all bi-Cayley graphs of GG of valency at most mm 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 U×V,U \times V, where UU is a homocyclic group of odd order, and VV is trivial or one of the groups Z2r,\Z_{2^r}, Z2r\Z_2^r and \Q8\Q_8.

Keywords

Cite

@article{arxiv.1308.6812,
  title  = {A classification of nilpotent 3-BCI groups},
  author = {Hiroki Koike and István Kovács},
  journal= {arXiv preprint arXiv:1308.6812},
  year   = {2013}
}
R2 v1 2026-06-22T01:18:07.012Z