In mathematics, the Cheeger constant (or Cheeger 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, and low-dimensional topology . The Cheeger constant is named after the mathematician Jeff Cheeger.
| Property | Value |
|---|
| p:abstract
| - In mathematics, the Cheeger constant (or Cheeger 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, and low-dimensional topology . The Cheeger constant is named after the mathematician Jeff Cheeger. (en)
|
| p:hasPhotoCollection
| |
| rdfs:comment
| - In mathematics, the Cheeger constant (or Cheeger 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, and low-dimensional topology . The Cheeger constant is named after the mathematician Jeff Cheeger. (en)
|
| rdfs:label
| - Cheeger constant (graph theory) (en)
|
| owl:sameAs
| |
| skos:subject
| |
| foaf:depiction
| |
| foaf:img
| |
| foaf:page
| |
| is p:redirect
of | |
![[RDF Data]](http://dbpedia.org/statics/sw-cube.png)
