GraphTheory
Girth
Calling Sequence
Parameters
Description
Examples
Girth(G)
G
-
undirected unweighted graph
Girth returns the length of the shortest cycle in a simple graph.
withGraphTheory:
withSpecialGraphs:
G≔HypercubeGraph3
G≔Graph 1: an undirected graph with 8 vertices and 12 edge(s)
GirthG
4
P≔PetersenGraph
P≔Graph 2: an undirected graph with 10 vertices and 15 edge(s)
GirthP
5
See Also
CycleBasis
OddGirth
Download Help Document