The smallest graph of girth 6 and valency 7

With the aid of a computer. we give a regular graph of girth 6 and valency 7, which has 90 vertices and show that this is the unique smallest graph with these properties.

[1]  W. T. Tutte.  Connectivity in graphs , 1966 .

[2]  R. Singleton.  On Minimal graphs of maximum even girth , 1966 .

[3]  M. O'Keefe,et al.  A smallest graph of girth 5 and valency 6 , 1979, J. Comb. Theory, Ser. B.

[4]  Norman Biggs,et al.  Graphs with even girth and small excess , 1980, Mathematical Proceedings of the Cambridge Philosophical Society.

[5]  W. F. McGee.  A Minimal Cubic Graph of Girth Seven , 1960, Canadian Mathematical Bulletin.

[6]  W. T. Tutte.  A family of cubical graphs , 1947, Mathematical Proceedings of the Cambridge Philosophical Society.