The minimal trivalent graphs with given smallest odd cycle (Q1058528): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Graphs with prescribed degree sets and girth / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Möbius Ladders / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Regular graphs with given girth pair / rank | |||
Normal rank | |||
Latest revision as of 17:45, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimal trivalent graphs with given smallest odd cycle |
scientific article |
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
