English

Isomorphisms of bi-Cayley graphs on generalized quaternion groups

Combinatorics 2025-01-22 v2

Abstract

Let GG be a finite group and SS be a subset of GG. The bi-Cayley graph BCay(G,S)\mathrm{BCay}(G,S) is the graph with vertex set G×{0,1}G\times \{0,1\} and edge set {{(x,0),(sx,1)}xG,sS}\{\{(x,0),(sx,1)\}\mid x\in G,s\in S\}. A bi-Cayley graph BCay(G,S)\mathrm{BCay}(G,S) is called a BCI-graph if for every TGT\subseteq G, the isomorphism BCay(G,S)BCay(G,T)\mathrm{BCay}(G,S)\cong \mathrm{BCay}(G,T) implies that T=gSαT=gS^\alpha for some gGg\in G and αAut(G)\alpha\in \mathrm{Aut}(G). We say a group GG an mm-BCI-group if every bi-Cayley graphs of GG with valency at most mm is a BCI-graph. In this paper, we show that for m{2,3}m\in\{2,3\}, the generalized quaternion group of order 4n4n with n2n\geq 2 is an mm-BCI-group if and only if it is an mm-DCI-group if and only if it is an mm-CI-group if and only if nn is odd or n=2n=2.

Keywords

Cite

@article{arxiv.2409.11918,
  title  = {Isomorphisms of bi-Cayley graphs on generalized quaternion groups},
  author = {Jin-Hua Xie and Zhishuo Zhang},
  journal= {arXiv preprint arXiv:2409.11918},
  year   = {2025}
}

Comments

15