A Minimal Cubic Graph of Girth Seven
- 1 May 1960
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 3 (2) , 149-152
- https://doi.org/10.4153/cmb-1960-018-1
Abstract
A “cubic” graph is one with three edges incident on each vertex. Let v and e be the number of vertices and edges, respectively. Then 3v = 2e for a cubic graph. The girth of a graph is the smallest number of edges in any non-trivial polygon. A minimal graph is one with the smallest number of edges with its particular properties. The minimal cubic graphs of girths one to eight, excluding seven, are discussed in Tutte's paper [1]. A minimal cubic graph of girth seven is given here.Keywords
This publication has 3 references indexed in Scilit:
- A Non-Hamiltonian GraphCanadian Mathematical Bulletin, 1960
- Self-dual configurations and regular graphsBulletin of the American Mathematical Society, 1950
- A family of cubical graphsMathematical Proceedings of the Cambridge Philosophical Society, 1947