Weakly Flag-transitive Configurations and Half-arc-transitive Graphs
✍ Scribed by Dragan Marušič; Tomaž Pisanski
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 204 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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‐determini
A subgroup G of automorphisms of a graph X is said to be 1 2 -transitive if it is vertex-and edge-but not arc-transitive. The graph X is said to be 1 2 -transitive if Aut X is 1 2 -transitive. The correspondence between regular maps and 1 2 -transitive group actions on graphs of valency 4 is studied
Let X be a vertex-transitive graph, that is, the automorphism group Aut(X ) of X is transitive on the vertex set of X . The graph X is said to be symmetric if Aut(X ) is transitive on the arc set of X . Suppose that Aut(X ) has two orbits of the same length on the arc set of X . Then X is said to be
## 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
## Abstract We establish natural bijections between three different classes of combinatorial objects; namely certain families of locally 2‐arc transitive graphs, partial linear spaces, and homogeneous factorizations of arc‐transitive graphs. Moreover, the bijections intertwine the actions of the re