Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T12:39:48.547Z Has data issue: false hasContentIssue false

A Minimal Cubic Graph of Girth Seven

Published online by Cambridge University Press:  20 November 2018

W. F. McGee*
Affiliation:
University of Toronto
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1960