Minimum degree
Summary
The minimum degree of a finite graph is the smallest degree of its vertices. Many theorems guarantee a structure, such as a long cycle, from a lower bound on the minimum degree. The node minimum degree gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Degree_(graph_theory), Special values
About this page
| Tag | 0ZFZ8ZG3EN |
|---|---|
| URI | m2://0ZFZ8ZG3EN |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C07 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.