Girth (graph theory)

Length of a shortest cycle contained in the graph

In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (that is, it is a forest), its girth is defined to be infinity. For example, a 4-cycle (square) has girth 4.

From Wikipedia, under CC BY-SA. More on occurri.