A class of symmetric graphs with 2-arc-transitive quotients
Abstract
Let be a finite X-symmetric graph with a nontrivial X-invariant partition B on V() such that B is a connected (X,2)-arc-transitive graph and is not a multicover of B. This article aims to give a characterization of (, X, B) for the case where |(C) B| = 3 for B∈ B and C ∈ B(B). This investigation requires a study on (X,2)-arc-transitive graphs of valency 4 or 7. We give a characterization of tetravalent (X,2)-arc-transitive graphs at first; and as a byproduct, we prove that every tetravalent (X,2)-transitive graph is either the complete graph on 5 vertices or a near n-gonal graph for some n 4. Then we show that a heptavalent (X,2)-arc-transitive graph can occur as B if and only if Xτ(τ) PSL(3,2) for τ∈ V().
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.