✦ LIBER ✦

An infinite series of regular edge- but not vertex-transitive graphs

✍ Scribed by Felix Lazebnik; Raymond Viglione

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 91 KB
Volume: 41
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10064

No coin nor oath required. For personal study only.

✦ Synopsis

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 q elements. For n=2 and q=3, our graph is isomorphic to the Gray graph. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 249–258, 2002

📜 SIMILAR VOLUMES

Constructing cubic edge- but not vertex-

Constructing cubic edge- but not vertex-transitive graphs

✍ Dragan Marušič 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

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