Abstract
A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In this paper, we investigate 1-arc-regular graphs of prime valency, especially of valency 3. First, we prove that if G is a soluble group then a (G, 1)-arc-regular graph must be a Cayley graph of a subgroup of G. Next we consider trivalent Cayley graphs of a finite nonabelian simple group and obtain a sufficient condition under which one can guarantee that Cay(G, S) is 1-arc-regular. Finally, as an application of the result, we construct two infinite families of 1-arc-regular trivalent Cayley graphs with insoluble automorphism groups and, in particular, one of the families is not a Cayley graph. © 2002 Elsevier Science Ltd. All rights reserved.
Cite
CITATION STYLE
Fang, X., Wang, J., & Xu, M. Y. (2002). On 1-arc-regular graphs. European Journal of Combinatorics, 23(7), 785–791. https://doi.org/10.1006/eujc.2002.0579
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.