On a class of finite symmetric graphs

Authors:
Sanming Zhou
Affiliations:
Department of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia
Venue:
European Journal of Combinatorics
Year:
2008

Citing 8
Cited 0

Automorphism groups of symmetric graphs of valency 3

Journal of Combinatorial Theory Series B - Series B
Imprimitive symmetric graphs, 3-arc graphs and 1-designs

Discrete Mathematics - Algebraic and topological methods in graph theory
Constructing a class of symmetric graphs

European Journal of Combinatorics
On 2-arc-transitivity of Cayley graphs

Journal of Combinatorial Theory Series B
Almost Covers Of 2-Arc Transitive Graphs

Combinatorica
Finite symmetric graphs with two-arc transitive quotients

Journal of Combinatorial Theory Series B
A Local Analysis of Imprimitive Symmetric Graphs

Journal of Algebraic Combinatorics: An International Journal
Finite symmetric graphs with two-arc transitive quotients II

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let @C be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of @C. This paper aims to characterize (@C,G) under the conditions that the quotient graph @C"B is (G,2)-arc transitive and the induced subgraph between two adjacent blocks is 2@?K"2 or K"2","2. The results answer two questions about the relationship between @C and @C"B for this class of graphs.