𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing cubic edge- but not vertex-transitive graphs

✍ Scribed by Dragan Marušič

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
118 KB
Volume
35
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 cubic non-Cayley vertex-transitive gr
On cubic non-Cayley vertex-transitive graphs
✍ Klavdija Kutnar,; Dragan Marušič;; Cui Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract In 1983, the second author [D. Marušič, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers __n__ there exists a non‐Cayley vertex‐transitive graph on __n__ vertices. (The term __non‐Cayley numbers__ has later been given to such integers.) Motivated by this problem,

Cubic vertex-transitive graphs of order
Cubic vertex-transitive graphs of order 2pq
✍ Jin-Xin Zhou; Yan-Quan Feng 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1 / ∈ S and S = {s -1 | s ∈ S}. The Cayley graph Cay(G, S) on G with respect to S

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.