论文信息 - The Smallest Cubic Graphs of Girth Nine

The Smallest Cubic Graphs of Girth Nine

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.

[1] C. W. Evans. A second trivalent graph with 58 vertices and girth 9 , 1984, J. Graph Theory.

[2] R. Read. Every one a winner , 1978 .

[3] Norman L. Biggs,et al. A trivalent graph with 58 vertices and girth 9 , 1980, Discret. Math..

[4] Pak-Ken Wong,et al. Cages - a survey , 1982, J. Graph Theory.

[5] G. Brinkmann. Fast generation of cubic graphs , 1996 .

[6] R. M. Damerell. On Moore graphs , 1973, Mathematical Proceedings of the Cambridge Philosophical Society.

[7] H. Sachs,et al. Regukre Graphen gegebener Taillenweite mit minimaler Knotenzahl , 1963 .

[8] R. Read. Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations , 1978 .

[9] R. Frucht,et al. Remarks On Finite Groups Defined By Generating Relations , 1955, Canadian Journal of Mathematics.