𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nilpotent groups and transitive graphs

✍ Scribed by Norbert Seifter

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
610 KB
Volume
45
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamiltonian cycles and paths in vertex-t
Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups
✍ Marc J. Lipman πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 378 KB

In 1968, L. Lovfisz conjectured that every connected, vertex-transitive graph had a Hamiltonian path. In this paper the following results are proved: (1) If a connected graph has a transitive nilpotent group acting on it, then the graph has a Hamiltonian path; (2) a connected, vertex-transitive grap

Semi-transitive graphs
Semi-transitive graphs
✍ Steve Wilson πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 284 KB

## Abstract In this paper, we first consider graphs allowing symmetry groups which act transitively on edges but not on darts (directed edges). We see that there are two ways in which this can happen and we introduce the terms __bi‐transitive__ and __semi‐transitive__ to describe them. We examine t

On Graphs Admitting Arc-Transitive Actio
On Graphs Admitting Arc-Transitive Actions of Almost Simple Groups
✍ Xin Gui Fang; Cheryl E Praeger πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 217 KB

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