Isomorphisms of bi-Cayley graphs on generalized quaternion groups
Combinatorics
2025-01-22 v2
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 .
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