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.
2020
2020
Return random walks for link prediction
2015
2015
A warped product version of the Cheeger-Gromoll splitting theorem
We prove a new generalization of the Cheeger-Gromoll splitting theorem where we obtain a warped product splitting under the… 
2015
2015
Cheeger N-clusters
In this paper we introduce a Cheeger-type constant defined as a minimization of a suitable functional among all the N-clusters… 
2014
2014
Metastability of the Ising model on random regular graphs at zero temperature
We study the metastability of the ferromagnetic Ising model on a random r-regular graph in the zero temperature limit. We prove… 
2013
2013
Absorption time of the Moran process
The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process… 
2009
2009
Geodesics of the Cheeger-Gromoll Metric
The main purpose of the paper is to investigate geodesics on the tangent bundle with respect to the Cheeger-Gromoll metric. 
2000
2000
CHEEGER ISOPERIMETRIC CONSTANTS OF GROMOV-HYPERBOLIC SPACES WITH QUASI-POLES
Let X be a non-compact complete manifold (or a graph) which admits a quasi-pole and has bounded local geometry. Suppose that X is… 
1991
1991
Some relations between analytic and geometric properties of infinite graphs
Highly Cited
1989
Highly Cited
1989
Isoperimetric numbers of graphs
  • B. Mohar
  • Journal of combinatorial theory. Series B (Print)
  • 1989
  • Corpus ID: 30773439
Highly Cited
1989
Highly Cited
1989
Graphs with parallel mean curvature
We prove that if the graph Ff = {(x, f(x)): x E M} of a map f: (M, g) -(N, h) between Riemannian manifolds is a submanifold of (M… 
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)