A characterisation on arc-transitive graphs of prime valency

Jing Jian Li, Bo Ling and Guodong Liu

Applied Mathematics and Computation, 2018, vol. 325, issue C, 227-233

Abstract: Let Γ be a finite simple undirected graph and G ≤ Aut(Γ). If G is transitive on the set of s-arcs but not on the set of (s+1)-arcs of Γ, then Γ is called (G, s)-transitive. For a connected (G, s)-transitive graph Γ of prime valency, the vertex-stabilizer Gα with α ∈ V(Γ) has been determined when Gα is solvable. In this paper, we give a characterization of the vertex-stabilizers of (G, s)-transitive graphs of prime valency when Gα is unsolvable.

Keywords: Arc-transitive graph; s-transitive graph; Automorphism group (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317308834
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:325:y:2018:i:c:p:227-233

DOI: 10.1016/j.amc.2017.12.024

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