𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finite vertex-biprimitive edge-transitive tetravalent graphs

✍ Scribed by Li, Cai Heng; Zhang, Hua

Book ID
122279793
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
427 KB
Volume
317
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Tetravalent edge-transitive graphs of or
Tetravalent edge-transitive graphs of orderp2q
✍ Pan, JiangMin; Liu, Yin; Huang, ZhaoHong; Liu, ChenLong πŸ“‚ Article πŸ“… 2013 πŸ› SP Science China Press 🌐 English βš– 240 KB
Finite edge-transitive dihedrant graphs
Finite edge-transitive dihedrant graphs
✍ Jiangmin Pan; Xue Yu; Hua Zhang; Zhaohong Huang πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 247 KB
Tetravalent half-edge-transitive graphs
Tetravalent half-edge-transitive graphs and non-normal Cayley graphs
✍ Xiuyun Wang; Yan-Quan Feng πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 206 KB

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