The minimal trivalent graphs with given smallest odd cycle
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.
scientific article; zbMATH DE number 3900807