Assume that \(\Gamma\) is a graph, \(G\) is a group acting transitively on the arcs, \({\mathcal B}\) is a nontrivial \(G\)-invariant partition of block size \(v\geq 3\) such that \(\Gamma_{\mathcal B}\) is connected and \(\Gamma_{\mathcal B}\not\simeq K_{v+1}\). Assume further that the edges of \(\Gamma\) between adjacent blocks of \({\mathcal B}\) form a matching of \(v-1\) edges, and the design \({\mathcal D}({B})\) (\(B\in{\mathcal B}\)) has no repeated blocks. Then, for some even \(n\geq 4\), \(\Gamma_{\mathcal B}\) is a (\(G,2\))-arc transitive near \(n\)-gonal graph with respect to a certain \(G\)-orbit on \(n\) cycles of \(\Gamma_{\mathcal B}\). This complements the case \(\Gamma_{\mathcal B}\simeq K_{v+1}\) classified by Gardiner and Praeger.
- Classification of a family of symmetric graphs with complete 2-arc-transitive quotients
- Diameter and connectivity of 3-arc graphs
- Finite symmetric graphs with 2-arc-transitive quotients: general affine case
- Finite symmetric graphs with two-arc transitive quotients
- Constructing a class of symmetric graphs
- Graphs that contain multiply transitive matchings
- 2-arc-transitive metacyclic covers of complete graphs
- Constructing 2-arc-transitive covers of hypercubes
- On a class of finite symmetric graphs
- A local analysis of imprimitive symmetric graphs
- Large 2-transitive arcs
- A family of symmetric graphs with complete quotients
- A class of symmetric graphs with 2-arc transitive quotients
- Two-arc transitive near-polygonal graphs
- Solution to a question on a family of imprimitive symmetric graphs
- Arc transitive covering digraphs and their eigenvalues
- Unitary graphs and classification of a family of symmetric graphs with complete quotients
- A construction of imprimitive symmetric graphs which are not multicovers of their quotients
- Topological covers of complete graphs
- Symmetric graphs with complete quotients
- Two‐arc closed subsets of graphs
- SYMMETRIC GRAPHS WITH 2-ARC TRANSITIVE QUOTIENTS
- A study of 3-arc graphs
- Trivalent 2-arc transitive graphs of type \(G^1_2\) are near polygonal
- A family of symmetric graphs in relation to 2-point-transitive linear spaces
- Hadwiger's conjecture for 3-arc graphs
- Hamiltonicity of 3-arc graphs
- Finite vertex primitive 2-arc regular graphs
This page was built for publication: Almost covers of 2-arc transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567405)
