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 language | English |
---|---|
Pages (from-to) | 249-258 |
Number of pages | 10 |
Journal | Journal of Graph Theory |
Volume | 41 |
Issue number | 4 |
DOIs | |
State | Published - Dec 2002 |