Author:
Brinkmann Gunnar,Mckay Brendan D.,Saager Carsten
Abstract
We describe two computational methods for the construction of cubic graphs with given girth. These were used to produce two independent proofs that the (3,9)-cages, defined as the smallest cubic graphs of girth 9, have 58 vertices. There are exactly 18 such graphs. We also show that cubic graphs of girth 11 must have at least 106 vertices and cubic graphs of girth 13 must have at least 196 vertices.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference12 articles.
1. Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl;Erdős;Wiss. Z. Uni. Halle (Math. Nat.),1963
2. A second trivalent graph with 58 vertices and girth 9
3. Cages—a survey
4. A trivalent graph with 58 vertices and girth 9
5. [10] McKay B. D. (1993) Isomorph free exhaustive generation. Preprint.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On graphs with excess or defect 2;Discrete Applied Mathematics;2015-01
2. Geometric Configurations;Configurations from a Graphical Viewpoint;2012-07-27
3. Combinatorial Configurations;Configurations from a Graphical Viewpoint;2012-07-27
4. Maps;Configurations from a Graphical Viewpoint;2012-07-27
5. Groups, Actions, and Symmetry;Configurations from a Graphical Viewpoint;2012-07-27