Isomorphisms of bi-Cayley graphs on generalized quaternion groups
Jin-Hua Xie, Zhishuo Zhang

TL;DR
This paper characterizes when bi-Cayley graphs on generalized quaternion groups are isomorphic, showing that for valency 2 and 3, these groups are BCI, DCI, and CI groups only under specific conditions related to the order parameter n.
Contribution
It provides a complete characterization of generalized quaternion groups as m-BCI, m-DCI, and m-CI groups for m=2,3, based on the parity of n.
Findings
Generalized quaternion groups of order 4n are m-BCI, m-DCI, and m-CI groups if and only if n is odd or n=2.
The equivalence of m-BCI, m-DCI, and m-CI properties is established for these groups.
The characterization applies specifically to bi-Cayley graphs with valency at most 3.
Abstract
Let be a finite group and be a subset of . The bi-Cayley graph is the graph with vertex set and edge set . A bi-Cayley graph is called a BCI-graph if for every , the isomorphism implies that for some and . We say a group an -BCI-group if every bi-Cayley graphs of with valency at most is a BCI-graph. In this paper, we show that for , the generalized quaternion group of order with is an -BCI-group if and only if it is an -DCI-group if and only if it is an -CI-group if and only if is odd or .
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 applications · Algebraic and Geometric Analysis
