You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Article
Title:
A Minimal Cubic Graph of Girth Seven
Contributor:
McGee, W. F.
Published:
Canadian Mathematical Society, 1960
Published in:
Canadian Mathematical Bulletin, 3 (1960) 2, Seite 149-152
Language:
English
DOI:
10.4153/cmb-1960-018-1
ISSN:
0008-4395;
1496-4287
Origination:
Footnote:
Description:
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.