Girth

Girth --- обхват.

The girth [math]\displaystyle{ g(G) }[/math] of the graph [math]\displaystyle{ G }[/math] is the length of its shortest cycle. The girth is 1 iff [math]\displaystyle{ G }[/math] has a loop and it is 2 iff [math]\displaystyle{ G }[/math] has multiple edges.