English

A class of symmetric graphs with 2-arc-transitive quotients

Combinatorics 2009-06-02 v1 Algebraic Topology

Abstract

Let Γ\Gamma be a finite X-symmetric graph with a nontrivial X-invariant partition B\mathcal {B} on V(Γ)V(\Gamma) such that ΓB\Gamma_{\mathcal {B}} is a connected (X,2)-arc-transitive graph and Γ\Gamma is not a multicover of ΓB\Gamma_{\mathcal {B}}. This article aims to give a characterization of (Γ,X,B)(\Gamma, X, \mathcal {B}) for the case where Γ(C)B=3|\Gamma(C) \cap B| = 3 for BBB\in \mathcal {B} and CΓB(B)C \in \Gamma_{\mathcal {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 n4n\ge 4. Then we show that a heptavalent (X,2)(X,2)-arc-transitive graph Σ\Sigma can occur as ΓB\Gamma_{\mathcal {B}} if and only if XτΣ(τ)PSL(3,2)X_\tau^{\Sigma(\tau)}\cong PSL(3,2) for τV(Σ)\tau\in V(\Sigma).

Keywords

Cite

@article{arxiv.0906.0154,
  title  = {A class of symmetric graphs with 2-arc-transitive quotients},
  author = {Bin Jia and Zaiping Lu and Gaixia Wang},
  journal= {arXiv preprint arXiv:0906.0154},
  year   = {2009}
}

Comments

22 pages

R2 v1 2026-06-21T13:08:05.151Z