Girth

Girth

graph theory

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (that is, it is a forest), its girth is defined to be infinity.

Excerpt from the Wikipedia article “Girth (graph theory)”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Girth to your collection.

Play for free

Related cards