English

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

Combinatorics 2020-04-22 v1

Abstract

A graph Γ\Gamma 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 Γ\Gamma is normal if GG is a normal subgroup of Aut(Γ){\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.

Keywords

Cite

@article{arxiv.2004.09746,
  title  = {Normality of one-matching semi-Cayley graphs over finite abelian groups with maximum degree three},
  author = {Majid Arezoomand and Mohsen Ghasemi},
  journal= {arXiv preprint arXiv:2004.09746},
  year   = {2020}
}

Comments

10 pages