𝔖 Bobbio Scriptorium
✦   LIBER   ✦

1/2-Transitive Graphs of Order 3p

✍ Scribed by Brian Alspach; Ming-Yao Xu

Book ID
110420381
Publisher
Springer
Year
1994
Tongue
English
Weight
495 KB
Volume
3
Category
Article
ISSN
0925-9899

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

VERTEX-TRANSITIVE GRAPHS OF ORDER 2p
VERTEX-TRANSITIVE GRAPHS OF ORDER 2p
✍ Brian Alspach; Richard J. Sutcliffe πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 597 KB
Tetravalent vertex-transitive graphs of
Tetravalent vertex-transitive graphs of order 4p
✍ Jin-Xin Zhou πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 219 KB

A graph is __vertex‐transitive__ if its automorphism group acts transitively on vertices of the graph. A vertex‐transitive graph is a __Cayley graph__ if its automorphism group contains a subgroup acting regularly on its vertices. In this article, the tetravalent vertex‐transitive non‐Cayley graphs

Cubic vertex-transitive graphs of order
Cubic vertex-transitive graphs of order 2pq
✍ Jin-Xin Zhou; Yan-Quan Feng πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 166 KB

A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1 / ∈ S and S = {s -1 | s ∈ S}. The Cayley graph Cay(G, S) on G with respect to S