paper

Normality of one-matching semi-Cayley graphs over finite abelian groups with maximum degree three

arXiv:2004.09746

Abstract

A graph is said to be a semi-Cayley graph over a group if it admits as a semiregular automorphism group with two orbits of equal size. We say that is normal if is a normal subgroup of . We prove that every connected intransitive one-matching semi-Cayley graph, with maximum degree three, over a finite abelian group is normal and characterize all such non-normal graphs.

10 pages