Degeneracy (graph theory)

In graph theory, degeneracy is a measure of how spread out the connections are in a graph. It's like a measure of how busy or crowded the connections are in a graph. For example, if you had 10 people who are each connected to each other, the graph would have a low degeneracy because it would be really busy. But if there were only 3 people connected together, the graph would have a high degeneracy because it would be less crowded.