Back to Search Start Over

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

Authors :
Arezoomand, Majid
Ghasemi, Mohsen
Publication Year :
2020

Abstract

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

Subjects

Subjects :
Mathematics - Combinatorics
05C25

Details

Database :
arXiv
Publication Type :
Report
Accession number :
edsarx.2004.09746
Document Type :
Working Paper