Girth (graph theory)

In graph theory, the girth of a graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (i.e. it's an acyclic graph), its girth is defined to be infinity. For example, a 4-cycle (square) has girth 4. A grid has girth 4 as well, and a triangular mesh has girth 3. A graph with girth four or more is triangle-free.

单词	Girth of a graph
释义	Girth of a graph 英语百科 Girth (graph theory) In graph theory, the girth of a graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (i.e. it's an acyclic graph), its girth is defined to be infinity. For example, a 4-cycle (square) has girth 4. A grid has girth 4 as well, and a triangular mesh has girth 3. A graph with girth four or more is triangle-free.
随便看	troglocolous Trogloditic troglodyte,Chimpanzee troglodyte mode troglodyte,Pan troglodyte Troglodytes aedon troglodytes aedons troglodytes,Chimpanzee troglodytes,Pan troglodytess troglodytess troglodytess Troglodytes troglodytes troglodytes troglodytes taivanus Troglodytic troglodytical troglodytically troglodytics Troglodytidae troglodytidaes troglodytism Troglofauna Trogloglanis troglophile troglophilous

Girth of a graph

Girth (graph theory)