Degeneracy (graph theory)
id:
degeneracy-graph-theory-322-13253057
title:
Degeneracy (graph theory)
text:
In graph theory, a k-degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph's edges. The degeneracy of a graph is the smallest value of k for which it is k-degenerate. The degeneracy of a graph is a measure of how sparse it is, and is within a constant factor of other sparsity measures such as the arboricity of a graph. Degeneracy is also known as the k-core number, width, and linka
brand slug:
wiki
category slug:
encyclopedia
description:
Measurement of graph sparsity
original url:
https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)
date created:
date modified:
2024-01-11T06:36:57Z
main entity:
{"identifier":"Q5251771","url":"https://www.wikidata.org/entity/Q5251771"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/08/2-degenerate_graph_2-core.svg","width":585,"height":225}
fields total:
13
integrity:
15