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

Felix Lazebnik, Raymond Viglione

Research output: Contribution to journalArticlepeer-review

35 Scopus citations

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 2qn+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.

Original languageEnglish
Pages (from-to)249-258
Number of pages10
JournalJournal of Graph Theory
Volume41
Issue number4
DOIs
StatePublished - Dec 2002

Fingerprint

Dive into the research topics of 'An infinite series of regular edge- but not vertex-transitive graphs'. Together they form a unique fingerprint.

Cite this