Girth returns the length of the shortest cycle in a simple graph.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$\mathrm{with}\left(\mathrm{SpecialGraphs}\right)\:$

$G≔\mathrm{HypercubeGraph}\left(3\right)$

$G≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 8\; vertices\; and\; 12\; edges}$

$\mathrm{Girth}\left(G\right)$

$4$

$P≔\mathrm{PetersenGraph}\left(\right)$

$P≔\mathrm{Graph\; 2:\; an\; undirected\; graph\; with\; 10\; vertices\; and\; 15\; edges}$

$\mathrm{Girth}\left(P\right)$

$5$