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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We introduce a family of multi-way Cheeger-type constants {hk , k = 1, 2, . . . , N} on a signed graph Γ = (G, σ) such that hk… (More)
Is this relevant?
2009
2009
We will give proofs to four isoperimetric inequalities which are variations of the original Cheeger inequality relating… (More)
Is this relevant?
2008
2008
In Ch], Cheeger proved the following general lower bound for the rst eigenvalue 1 of a closed Riemannian manifold: Theorem ((Ch… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider Laplacians for directed graphs and examine their eigenvalues. We introduce a notion of a circulation in a directed… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper we explore how to embed symbolic relational graphs with unweighted edges in a pattern-space. We adopt a graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2003
2003
  • Gen-ichi OSHIKIRI
  • 2003
In the branches of both differential geometry and graph theory, Cheeger constant plays a central role in the study of eigenvalues… (More)
Is this relevant?
1998
1998
It is shown that a connected sum of an arbitrary number of complex projective planes carries a metric of positive Ricci curvature… (More)
Is this relevant?
1997
1997
  • Oded SchrammThe
  • 1997
It is shown that every (innnite) graph with a positive Cheeger constant contains a tree with a positive Cheeger constant… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this thesis we investigate the spectrum of the Laplacian matrix of a graph. Although its use dates back to Kirchhoff, most of… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
For Xs V(G), let 8X denote the set of edges of the graph G having one end in X and the other end in V(G)\X. The quantity i(G… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?