## Abstract A detailed description is given of a recently discovered edge‐transitive but not vertex‐transitive trivalent graph on 112 vertices, which turns out to be the third smallest example of such a semisymmetric cubic graph. This graph has been called the __Ljubljana graph__ by the first autho
✦ LIBER ✦
A graph which is edge transitive but not arc transitive
✍ Scribed by D. F. Holt
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 167 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A graph having 27 vertices is described, whose automorphism group is transitive on vertices and undirected edges, but not on directed edges.
📜 SIMILAR VOLUMES
The edge-transitive but not vertex-trans
✍
Marston Conder; Aleksander Malnič; Dragan Marušič; Tomaž Pisanski; Primož Potočn
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 220 KB
👁 1 views
Constructing cubic edge- but not vertex-
✍
Dragan Marušič
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 118 KB
👁 1 views
An infinite series of regular edge- but
✍
Felix Lazebnik; Raymond Viglione
📂
Article
📅
2002
🏛
John Wiley and Sons
🌐
English
⚖ 91 KB
👁 1 views
## Abstract Let __n__ be an integer and __q__ be a prime power. Then for any 3 ≤ __n__ ≤ __q__−1, or __n__=2 and __q__ odd, we construct a connected __q__‐regular edge‐but not vertex‐transitive graph of order 2__q__^__n__+1^. This graph is defined via a system of equations over the finite field of
A Family of Quasiprimitive 2-arc Transit
✍
C.H. Li
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 85 KB