undirected unweighted graph
Girth returns the length of the shortest cycle in a simple graph.
G ≔ HypercubeGraph⁡3
G≔Graph 1: an undirected graph with 8 vertices and 12 edge(s)
P ≔ PetersenGraph⁡
P≔Graph 2: an undirected graph with 10 vertices and 15 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)