The girth of a graph is the length of the shortest cycle in .11There is no widespread agreement on the girth of a forest, which has no cycles. It is also extremely unimportant.
For instance, the girth of any grid (where ) is 4, and the girth of the vertex graph of the dodecahedron is 5.
|Date of creation||2013-03-22 12:45:56|
|Last modified on||2013-03-22 12:45:56|
|Last modified by||ariels (338)|