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

preprint2020arXivOpen access

Abstract

A graph ΓΓ is said to be a semi-Cayley graph over a group GG if it admits GG as a semiregular automorphism group with two orbits of equal size. We say that ΓΓ is normal if GG is a normal subgroup of Aut(Γ){\rm Aut}(Γ). 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.