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
✦ LIBER ✦
Tetravalent -transitive graphs of order
✍ Scribed by Jin-Xin Zhou
- Book ID
- 108114156
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 534 KB
- Volume
- 309
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Tetravalent vertex-transitive graphs of
✍
Jin-Xin Zhou
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 219 KB
The edge-transitive tetravalent Cayley g
✍
Cai Heng Li; Zhe Liu; Zai Ping Lu
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 356 KB
Tetravalent arc-transitive graphs of ord
✍
Katja Berčič; Mohsen Ghasemi
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 212 KB
Tetravalents-Transitive Graphs of Order
✍
Mohsen Ghasemi, Jin-Xin Zhou
📂
Article
📅
2011
🏛
Springer Japan
🌐
English
⚖ 224 KB
Arc-transitive cycle decompositions of t
✍
Štefko Miklavič; Primož Potočnik; Steve Wilson
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 189 KB
Tetravalent half-edge-transitive 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