Name
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. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 249–258, 2002 |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1002/jgt.v41:4 | Journal of Graph Theory |
Keywords | Field | DocType |
finite field,system of equations,infinite series,gray graph | Discrete mathematics,Circulant graph,Combinatorics,Line graph,Edge-transitive graph,Clebsch graph,Regular graph,Distance-regular graph,Symmetric graph,Mathematics,Voltage graph | Journal |
Volume | Issue | ISSN |
41 | 4 | 0364-9024 |
Citations | PageRank | References |
20 | 1.46 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Felix Lazebnik | 1 | 353 | 49.26 |
| Raymond Viglione | 2 | 28 | 2.61 |