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)

Related topics

Related topics

8 relations
Algebraic connectivityConductance (graph)Connectivity (graph theory)End (graph theory)

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Growing in time IDLA cluster is recurrent
We show that Internal Diffusion Limited Aggregation (IDLA) on $\mathbb{Z}^d$ has near optimal Cheeger constant when the growing… 
Review
2016
Review
2016
The Cheeger constant of a quantum graph
We review the theory of Cheeger constants for graphs and quantum graphs and their present and envisaged applications. (© 2016… 
2010
2010
The Cheeger Constant: from Discrete to Continuous
2010
2010
Group Width
There are many"minimax"complexity functions in mathematics: width of a tree or a link, Heegaard genus of a 3-manifold, the… 
2008
2008
k-Free-like groups
The following results are proved. In Theorem 1, it is stated that there exist both finitely presented and not finitely presented… 
2007
2007
Spectral Radius and Amenability in Hilbert Geometries
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… 
2007
2007
Classification by Cheeger Constant Regularization
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high… 
2004
2004
Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming Graphs
We prove that the set of first k vertices of a Hamming graph in reverse-lexicographic order constitutes an extremal set… 
2003
2003
bottleneck constants of finite graphs
In this note we consider an example to test three lower bounds presented in Diaconis– Stroock [4] (one by Diaconis and Stroock… 
1999
1999
The Edge-isoperimetric Number of Generalized Cylinders
A $d$--dimensional generalized cylinder $G^d$ is the Cartesian product of $d$ graphs, each of which is a path graph or a cycle… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)