English

Every finite group has a normal bi-Cayley graph

Combinatorics 2016-07-15 v1

Abstract

A graph \G\G with a group HH of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over HH. When HH is a normal subgroup of \Aut(\G)\Aut(\G), we say that \G\G is {\em normal} with respect to HH. 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.

Keywords

Cite

@article{arxiv.1607.03981,
  title  = {Every finite group has a normal bi-Cayley graph},
  author = {Jin-Xin Zhou},
  journal= {arXiv preprint arXiv:1607.03981},
  year   = {2016}
}
R2 v1 2026-06-22T14:54:14.488Z