Girth

Girth generally refers to the Circumference of a cylindrical object, such as a tree trunk. In Graph Theory , the girth of a graph is the length of the shortest Cycle contained in the graph. If the graph doesn't contain any cycles, its girth is defined to be Infinity . For example, a 4-cycle (square) has girth 4. A grid has girth 4 as well, and a triangular mesh has girth 3. A Cubic Graph of girth $g$ that is as small as possible is known as a $g$ - Cage Graph . The Petersen Graph is the unique 5-cage (it is the smallest cubic graph of girth 5). The Heawood Graph is the unique 6-cage, and the Tutte Eight Cage is the unique 8-cage.
	Image:Heawood GraphsvgThe	"http://wwwinformationdelightinfo/encyclopedia/entry/Heawood_graph" class="copylinks">Heawood Graph , of girth 6
	Image:Tutte Eight CagesvgThe	"http://wwwinformationdelightinfo/encyclopedia/entry/Tutte_eight_cage" class="copylinks">Tutte Eight Cage , of girth 8

Information About