Definition:Girth
From ProofWiki
Definition
Let $G$ be a graph.
The girth of $G$ is the smallest length of any cycle in $G$.
An acyclic graph is defined as having a girth of infinity.
- This page was last modified on 1 May 2011, at 04:24 and is 0 bytes
- This page has been accessed 210 times.
- Content is available under GNU Free Documentation License 1.2.
