𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The edge-transitive but not vertex-transitive cubic graph on 112 vertices

✍ Scribed by Marston Conder; Aleksander Malnič; Dragan Marušič; Tomaž Pisanski; Primož Potočnik

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
220 KB
Volume
50
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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 author, although it is believed that its existence may have been known by R. M. Foster. With the help of some advanced theory of covering graphs, various properties of this graph are analyzed, including a connection with the Heawood graph via ideals over polynomial rings. © 2005 Wiley Periodicals, Inc.

📜 SIMILAR VOLUMES

An infinite series of regular edge- but
An infinite series of regular edge- but not vertex-transitive graphs
✍ 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

On the Edge Connectivity, Hamiltonicity,
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs
✍ Jan van den Heuvel; Bill Jackson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GÂE(F ) is