bn:00341233n
Noun Concept
Categories: Graph invariants
EN
girth
EN
In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. Wikipedia
English:
graph theory
Definitions
Relations
Sources
EN
In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. Wikipedia
The length of a shortest cycle contained in a graph Wikipedia Disambiguation
Length of a shortest cycle contained in a graph Wikidata
The length of the shortest cycle in a graph. Wiktionary
Wikipedia
Wikidata
EN
Wiktionary
EN