Abstract
A graph is symmetric if its automorphism group acts transitively on the set of arcs of the graph. We classify connected heptavalent symmetric graphs of order 16p for each prime p. As a result, there are two such sporadic graphs with p = 3 and 7, and an infinite family of 1-regular normal Cayley graphs on the group [Formula: see text] with 7|(p – 1).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
