The minimal trivalent graphs with given smallest odd cycle (Q1058528)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The minimal trivalent graphs with given smallest odd cycle |
scientific article; zbMATH DE number 3900807
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimal trivalent graphs with given smallest odd cycle |
scientific article; zbMATH DE number 3900807 |
Statements
The minimal trivalent graphs with given smallest odd cycle (English)
0 references
1985
0 references
The main result of this paper is the following theorem: Let h be an odd integer with \(h\geq 5\). Then the Möbius ladder of order 2(h-1) is the unique minimal trivalent graph with odd girth h.
0 references
Möbius ladder
0 references
minimal trivalent graph
0 references
odd girth
0 references
