By theorems of Tutte, Weiss, and others, it is known that there are no finite symmetric graphs of degree greater than 2 with automorphism group transitive on 8-arcs, and that 7-arc-transitivity can occur only in the case of graphs of degree 3 m q 1. In this article it is shown that there are infinit
Stability of arc-transitive graphs
✍ Scribed by David B. Surowski
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 169 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0364-9024
- DOI
- 10.1002/jgt.1026
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The present paper investigates arc‐transtive graphs in terms of their stability, and shows, somewhat contrary to expectations, that the property of instability is not as rare as previously thought. Until quite recently, the only known example of a finite, arc‐transitive vertex‐determining unstable graph was the underlying graph of the dodecahedron. This paper illustrates some methods for constructing finite arc‐transitive unstable graphs, and three infinite families of such graphs are given as applications. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 95–110, 2001
📜 SIMILAR VOLUMES
Regular covers of complete graphs which are 2-arc-transitive are investigated. A classification is given of all such graphs whose group of covering transformations is either cyclic or isomorphic to Z p \_Z p , where p is a prime and whose fibrepreserving subgroup of automorphisms acts 2-arc-transiti
Let be an X -symmetric graph admitting an X -invariant partition B on V ( ) such that B is connected and (X , 2)-arc transitive. A characterization of ( , X , B) was given in [S. Zhou Eur J Comb 23 (2002), 741-760] for the case where |B|>| (C)∩B| = 2 for an arc (B, C) of B . We consider in this arti
Let ⌫ be a finite connected regular graph with vertex set V ⌫, and let G be a subgroup of its automorphism group Aut ⌫. Then ⌫ is said to be G-locally primiti¨e if, for each vertex ␣ , the stabilizer G is primitive on the set of vertices adjacent to ␣ ␣. In this paper we assume that G is an almost s
## Abstract Let $\Gamma$ be a finite __G__‐symmetric graph whose vertex set admits a nontrivial __G__‐invariant partition $\cal B$. It was observed that the quotient graph $\Gamma\_{\cal B}$ of $\Gamma$ relative to $\cal B$ can be (__G__, __2__)‐arc transitive even if $\Gamma$ itself is not necessa