Skip to search formSkip to main contentSkip to account menu

Cheeger constant (graph theory)

Known as: Cheeger number, Isoperimetric number 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
We review the theory of Cheeger constants for graphs and quantum graphs and their present and envisaged applications. (© 2016… 
2010
2010
Graph theory has attracted great attention for the problem of image segmentation in recent years. In this paper we deduce the… 
2008
2008
In this article, we derive bounds for values of the global geometry of locally tessellating planar graphs, namely, the Cheeger… 
2007
2007
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high… 
2007
2007
We study the bottom of the spectrum in Hilbert geometries, we show that it is zero if and only if the geometry is amenable, in… 
2002
2002
Let n, x be positive integers satisfying 1 < x < n. Let Hn,x be a group admitting a presentation of the form 〈a, b | a = b = (ba… 
1999
1999
A $d$--dimensional generalized cylinder $G^d$ is the Cartesian product of $d$ graphs, each of which is a path graph or a cycle… 
1993
1993
In Ch], Cheeger proved the following general lower bound for the rst eigenvalue 1 of a closed Riemannian manifold: Theorem ((Ch… 
1992
1992
  • R. Brooks
  • 1992
  • Corpus ID: 31301244