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.
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
Image threshold selection with Isoperimetric partition
Graph theory has attracted great attention for the problem of image segmentation in recent years. In this paper we deduce the… 
2008
2008
Geometric and spectral properties of locally tessellating planar graphs
In this article, we derive bounds for values of the global geometry of locally tessellating planar graphs, namely, the Cheeger… 
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… 
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
PROPERTIES OF GRAPHS IN RELATION TO THEIR SPECTRA
We will explain basic concepts of spectral graph theory, which studies graph properties via the algebraic characteristics of its… 
2002
2002
Isoperimetric Numbers of Cayley Graphs Arising from Generalized Dihedral Groups
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
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… 
1993
1993
On Cheeger's inequality
In Ch], Cheeger proved the following general lower bound for the rst eigenvalue 1 of a closed Riemannian manifold: Theorem ((Ch… 
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)