Girth
The length of the shortest graph cycle (if any) in a graph. Acyclic graphs are considered to have infinite girth (Skiena 1990, p. 191). The girth of a graph may be found using Girth[g] in the Wolfram Language package Combinatorica` . Precomputed girths for many named graphs can be obtained using GraphData[graph, "Girth"].
The following table gives examples of graphs with various girths.
| girth | example |
| 3 | tetrahedral
graph, complete graph  |
| 4 | cubical graph, utility graph |
| 5 | Petersen graph |
| 6 | Heawood graph |
| 7 | McGee graph |
| 8 | Levi graph |
Contact the MathWorld Team
circuits