Quasi-semiregular automorphisms of cubic and tetravalent arc-transitive graphs

Yan-Quan Feng, Ademir Hujdurović, István Kovács, Klavdija Kutnar and Dragan Marušič

Applied Mathematics and Computation, 2019, vol. 353, issue C, 329-337

Abstract: A non-trivial automorphism g of a graph Γ is called semiregular if the only power gi fixing a vertex is the identity mapping, and it is called quasi-semiregular if it fixes one vertex and the only power gi fixing another vertex is the identity mapping. In this paper, we prove that K4, the Petersen graph and the Coxeter graph are the only connected cubic arc-transitive graphs admitting a quasi-semiregular automorphism, and K5 is the only connected tetravalent 2-arc-transitive graph admitting a quasi-semiregular automorphism. It will also be shown that every connected tetravalent G-arc-transitive graph, where G is a solvable group containing a quasi-semiregular automorphism, is a normal Cayley graph of an abelian group of odd order.

Keywords: Cubic graph; Tetravalent graph; Arc-transitive; Quasi-semiregular automorphism (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319300633
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:353:y:2019:i:c:p:329-337

DOI: 10.1016/j.amc.2019.01.048

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().