Every finite group has a normal bi-Cayley graph

DOI10.26493/1855-3974.1298.937zbMATH Open1391.05133arXiv1607.03981OpenAlexW2963968479WikidataQ129391787 ScholiaQ129391787MaRDI QIDQ3174802FDOQ3174802

Jin-Xin Zhou

Publication date: 18 July 2018

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1607.03981

Recommendations

• The automorphisms of bi-Cayley graphs
• scientific article; zbMATH DE number 2074414
• Normal Cayley graphs of finite groups
• Edge-transitive bi-Cayley graphs
• Cubic bi-Cayley graphs over abelian groups

zbMATH Keywords

normalCartesian product.bi-Cayley

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cited In (6)

• On normality of \(n\)-Cayley graphs
• Title not available (Why is that?)
• On automorphisms of Haar graphs of abelian groups
• Normality of one-matching semi-Cayley graphs over finite abelian groups with maximum degree 3
• Existence of non-Cayley Haar graphs
• Symmetric property and reliability of locally twisted cubes

This page was built for publication: Every finite group has a normal bi-Cayley graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174802)