𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On edge but not vertex transitive regular graphs

✍ Scribed by I.Z Bouwer

Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
601 KB
Volume
12
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 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

The edge-transitive but not vertex-trans
The edge-transitive but not vertex-transitive cubic graph on 112 vertices
✍ Marston Conder; Aleksander Malnič; Dragan Marušič; Tomaž Pisanski; Primož Potočn 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

## 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

Vertex-transitive graphs that are not Ca
Vertex-transitive graphs that are not Cayley graphs. II
✍ McKay, Brendan D.; Praeger, Cheryl E. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 881 KB

The Petersen graph on 10 vertices is the smallest example of a vertex-transitive graph that is not a Cayley graph. In 1983, D. MaruSiE asked, "For what values of n does there exist such a graph on n vertices?" We give several new constructions of families of vertex-transitive graphs that are not Cay

A graph which is edge transitive but not
A graph which is edge transitive but not arc transitive
✍ D. F. Holt 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

## Abstract A graph having 27 vertices is described, whose automorphism group is transitive on vertices and undirected edges, but not on directed edges.

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