arXiv Analytics

Sign in

arXiv:1607.03981 [math.CO]AbstractReferencesReviewsResources

Every finite group has a normal bi-Cayley graph

Jin-Xin Zhou

Published 2016-07-14Version 1

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to $H$. In this paper, we show that every finite group has a connected normal bi-Cayley graph. This improves Theorem~5 of [M. Arezoomand, B. Taeri, Normality of 2-Cayley digraphs, Discrete Math. 338 (2015) 41--47], and provides a positive answer to the Question of the above paper.

Related articles: Most relevant | Search more
arXiv:1005.2250 [math.CO] (Published 2010-05-13, updated 2010-10-28)
Point regular groups of automorphisms of generalised quadrangles
arXiv:2108.05164 [math.CO] (Published 2021-08-11)
Automorphisms of the double cover of a circulant graph of valency at most 7
arXiv:2305.19277 [math.CO] (Published 2023-05-25)
Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:1 (2022) \#3]