𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semi-hyper-connected vertex transitive graphs

✍ Scribed by Zhao Zhang

Book ID
108114003
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
614 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex-transitive graphs
Vertex-transitive graphs
✍ Gert Sabidussi πŸ“‚ Article πŸ“… 1964 πŸ› Springer Vienna 🌐 English βš– 642 KB
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

Vertex-transitive graphs that remain con
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
✍ Y. O. Hamidoune; A. LladΓ³; S. C. LΓ³pez πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 148 KB

A d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex and its neighbors will be called vosperian. Let be a vertex-transitive graph of