Cheeger constant (graph theory)
Measure of whether or not a graph has a "bottleneck" / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Cheeger constant (graph theory)?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
This article is about the Cheeger constant in graph theory. For a different use in Riemannian geometry, see Cheeger constant.
In mathematics, the Cheeger constant (also Cheeger number or isoperimetric number) of a graph is a numerical measure of whether or not a graph has a "bottleneck". The Cheeger constant as a measure of "bottleneckedness" is of great interest in many areas: for example, constructing well-connected networks of computers, card shuffling. The graph theoretical notion originated after the Cheeger isoperimetric constant of a compact Riemannian manifold.
This article includes a list of general references, but it lacks sufficient corresponding inline citations. (February 2013) |
The Cheeger constant is named after the mathematician Jeff Cheeger.