The girth of a graphs is the length of one of its (if any) shortest graph cycles. 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.
