This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. Permission MUST be requested prior to use.
(c) Marian Olejar, Jr., 2005-2007
|
Mathematical Search Engine |
|
|
topic index: Complex Analysis Graph Theory Number Theory Plane Geometry Solid Geometry Statistics Topology locations: dictionary help with math text search |
girth
Author: Marian Olejar, Jr. Created: May/08/2006 Last edit: Sep/29/2006
graph theory:
Girth (denoted g(G)) is minimum length of smallest cycle in graph G = (V, E). The number of edges in its shortest cycle. If graph has a loop, then its girth is 1. If it has multiple edges, then its girth is at least 3. If graph is a tree, its girth is infinite. Sometimes denoted girth(G), g(G), ... relation between diameter and girth: g(G) `<=` 2diam(G) + 1 See also: radius of graph, Cite this article as: Marian Olejar, Jr.: girth from VeryPrime's Dictionary of mathematics Link to this page: http://www.veryprime.com/dict/girth.php |