Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Cheeger constant (graph theory)
open-in-new
<p>In <a href="/facts/Mathematics/pxTouaz4">mathematics</a>, the Cheeger constant (also Cheeger number or isoperimetric number) of a <a href="/facts/Graph_(discrete_mathematics)/kw3eIBUe">graph</a> 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 <a href="/facts/Computer_networking/3w5RM99p">networks of computers</a>, <a href="/facts/Shuffling/H8a3TynB">card shuffling</a>. The graph theoretical notion originated after the <a href="/facts/Cheeger_constant/4FoJFsrP">Cheeger isoperimetric constant</a> of a <a href="/facts/Compact_space/d0cgXJH7">compact</a> <a href="/facts/Riemannian_manifold/5KYnmEgF">Riemannian manifold</a>. </p><p>The Cheeger constant is named after the <a href="/facts/Mathematician/eaFSR8Fx">mathematician</a> <a href="/facts/Jeff_Cheeger/VTmcprIR">Jeff Cheeger</a>. </p>