On tetravalent s-regular Cayley graphs
2017 ◽
Vol 16
(10)
◽
pp. 1750195
◽
A Cayley graph [Formula: see text] is said to be core-free if [Formula: see text] is core-free in some [Formula: see text] for [Formula: see text]. A graph [Formula: see text] is called [Formula: see text]-regular if [Formula: see text] acts regularly on its [Formula: see text]-arcs. It is shown in this paper that if [Formula: see text], then there exist no core-free tetravalent [Formula: see text]-regular Cayley graphs; and for [Formula: see text], every tetravalent [Formula: see text]-regular Cayley graph is a normal cover of one of the three known core-free graphs. In particular, a characterization of tetravalent [Formula: see text]-regular Cayley graphs is given.
2018 ◽
Vol 17
(07)
◽
pp. 1850126
◽
Keyword(s):
2018 ◽
Vol 17
(09)
◽
pp. 1850178
◽
Keyword(s):
Keyword(s):
Keyword(s):