PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Medium Entry average rating: No information on entry rating
girth (Definition)

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

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



Footnotes

... .1
There is no widespread agreement on the girth of a forest, which has no cycles. It is also extremely unimportant.



"girth" is owned by ariels.
(view preamble | get metadata)

View style:

See Also: chromatic number and girth

Log in to rate this entry.
(view current ratings)

Cross-references: dodecahedron, vertex, grid, forest, cycle, length, graph
There are 9 references to this entry.

This is version 1 of girth, born on 2002-06-08.
Object id is 3074, canonical name is Girth.
Accessed 4739 times total.

Classification:
AMS MSC05C38 (Combinatorics :: Graph theory :: Paths and cycles)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)