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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.