|
|
|
|
|
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)
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 MSC: | 05C38 (Combinatorics :: Graph theory :: Paths and cycles) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
