Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Girth (graph theory)
open-in-new
<p>In <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, the girth of an <a href="/facts/Undirected_graph/kw3eIBUe">undirected graph</a> is the length of a shortest <a href="/facts/Cycle_(graph_theory)/Is44edrv">cycle</a> contained in the graph. If the graph does not contain any cycles (that is, it is a <a href="/facts/Forest_(graph_theory)/TCWk4Joy">forest</a>), its girth is defined to be <a href="/facts/Infinity/cF506uD7">infinity</a>. For example, a 4-cycle (square) has girth 4. A grid has girth 4 as well, and a triangular mesh has girth 3. A graph with girth four or more is <a href="/facts/Triangle-free_graph/8D3LJ44h">triangle-free</a>. </p>