girth

The girth of a graph $G$ is the length of the shortest cycle in $G$.

For instance, the girth of any grid ${\mathbb{Z}}^d$ (where $d>2$) is 4, and the girth of the vertex graph of the dodecahedron is 5.