A class of symmetric graphs with 2-arc-transitive quotients
Combinatorics
2009-06-02 v1 Algebraic Topology
Abstract
Let be a finite X-symmetric graph with a nontrivial X-invariant partition on such that is a connected (X,2)-arc-transitive graph and is not a multicover of . This article aims to give a characterization of for the case where for and . 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 . Then we show that a heptavalent -arc-transitive graph can occur as if and only if for .
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