2 search results - page 1 / 1 » Voltage Graphs, Group Presentations and Cages |
COMBINATORICS
2004
13 years 4 months ago
2004
We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations. AMS Su...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...