Tetravalent half-arc-transitive graphs of order p5

Huiwen Cheng and Li Cui

Applied Mathematics and Computation, 2018, vol. 332, issue C, 506-518

Abstract: A graph is half-arc-transitive if its full automorphism group acts transitively on vertices and edges, but not on arcs. Let p be a prime. It is known that there exists no tetravalent half-arc-transitive graph of order p or p2. All the tetravalent half-arc-transitive graphs of order p3 or p4 have been classified in two previous papers [9,23]. As a continuation, in this paper, a classification is given of all tetravalent half-arc-transitive graphs of order p5.

Keywords: Half-arc-transitive; Normal; Cayley graph (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318302571
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:332:y:2018:i:c:p:506-518

DOI: 10.1016/j.amc.2018.03.076

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 ().