On Cubic Graphs Admitting an Edge-Transitive Solvable Group
✍ Scribed by Aleksander Malnič; Dragan Marušič; Primož Potočnik
- Book ID
- 111587729
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Weight
- 149 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0925-9899
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract A detailed description is given of a recently discovered edge‐transitive but not vertex‐transitive trivalent graph on 112 vertices, which turns out to be the third smallest example of such a semisymmetric cubic graph. This graph has been called the __Ljubljana graph__ by the first autho
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
In the present paper we find all the graphs on which a dihedral group acts edge-transitively. First we explicitly build the permissible permutation representations of the dihedral group. Then we use this knowledge to find all the graphs on which a dihedral group acts edge-transitively. These graph