Title: Isomorphisms of bi-Cayley graphs on Dihedral groups
Abstract: For a group [Formula: see text] and a subset [Formula: see text] of [Formula: see text] the bi-Cayley graph BCay[Formula: see text] of [Formula: see text] with respect to [Formula: see text] is the bipartite graph with vertex set [Formula: see text] and edge set [Formula: see text]. A bi-Cayley graph BCay[Formula: see text] is called a BCI-graph if for any bi-Cayley graph BCay[Formula: see text], [Formula: see text] implies that [Formula: see text] for some [Formula: see text] and [Formula: see text]. A group [Formula: see text] is called a [Formula: see text]-BCI-group if all bi-Cayley graphs of [Formula: see text] with valency at most [Formula: see text] are BCI-graphs. In this paper, we characterize the [Formula: see text]-BCI dihedral groups for [Formula: see text]. Also, we show that the dihedral group [Formula: see text] ([Formula: see text] is prime) is a [Formula: see text]-BCI-group.
Publication Year: 2020
Publication Date: 2020-06-15
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot