Publication | Open Access
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
27
Citations
16
References
1997
Year
Geometric Graph TheoryNetwork ScienceGraph TheoryLarge Cayley GraphsVoltage GraphsComputer SearchLarge GraphsStructural Graph TheoryTopological Graph TheoryGiven DegreeAlgebraic Graph TheoryNetwork AnalysisEducationExtremal Graph TheoryPlanar GraphDiscrete MathematicsVoltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for application to the degree/diameter problem, which is to determine the largest order of a graph with given degree and diameter. Many currently known largest graphs of degree $\le 15$ and diameter $\le 10$ have been found by computer search among Cayley graphs of semidirect products of cyclic groups. We show that all of them can in fact be described as lifts of smaller Cayley graphs of cyclic groups, with voltages in (other) cyclic groups. This opens up a new possible direction in the search for large vertex-transitive graphs of given degree and diameter.
| Year | Citations | |
|---|---|---|
Page 1
Page 1