ScholarLens Back to search
1995•Combinatorics Probability ComputingRequires access

The Smallest Cubic Graphs of Girth Nine

Gunnar Brinkmann, Brendan D. McKay, Carsten Saager

Open publisher page 52 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 52 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Girth (graph theory), Combinatorics, Cubic graph, Odd graph, Mathematics, Discrete mathematics, Mathematical proof, Chordal graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Smallest Cubic Graphs of Girth Nine — Research Paper | ScholarLens