In graph theory, "degeneracy" is a property of a graph that measures how "sparse" the graph is in terms of its connectivity. Specifically, the degeneracy of a graph is defined as the smallest integer \( k \) such that every subgraph of the graph has a vertex of degree at most \( k \).

Ancestors (6)

  1. Graph algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version