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).
Precomputed girths for many named graphs can be obtained using GraphData[graph,
"Girth"].
The following table gives examples of graphs with various girths.
