# Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator

@article{Jost2021CheegerlikeIF,
title={Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator},
author={Jurgen Jost and Raffaella Mulas},
journal={Journal of Graph Theory},
year={2021},
volume={97},
pages={408 - 425}
}
• Published 27 October 2019
• Mathematics
• Journal of Graph Theory
We define a new Cheeger‐like constant for graphs and we use it for proving Cheeger‐like inequalities that bound the largest eigenvalue of the normalized Laplace operator.
Sharp bounds for the largest eigenvalue of the normalized hypergraph Laplace Operator
We generalize the classical sharp bounds for the largest eigenvalue of the normalized Laplace operator, $\frac{N}{N-1}\leq \lambda_N\leq 2$, to the case of chemical hypergraphs.
Sharp Bounds for the Largest Eigenvalue
• R. Mulas
• Mathematics
Mathematical Notes
• 2021
Abstract We generalize the classical sharp bounds for the largest eigenvalue of the normalized Laplace operator, $$N/(N-1)\leq \lambda_N\leq 2$$ , to the case of chemical hypergraphs.
Spectral theory of Laplace Operators on chemical hypergraphs
• Mathematics
• 2020
Several new spectral properties of the normalized Laplacian defined for chemical hypergraphs are shown. The eigenvalue $1$ and the case of duplicate vertices are discussed; two Courant nodal domain
p-Laplace Operators for Oriented Hypergraphs
• Mathematics
Vietnam Journal of Mathematics
• 2021
The p-Laplacian for graphs, as well as the vertex Laplace operator and the hyperedge Laplace operator for the general setting of oriented hypergraphs, are generalized. In particular, both a vertex
$p$-Laplace Operators for Chemical Hypergraphs.
• Mathematics
• 2020
The $p$-Laplacian for graphs, as well as the vertex Laplace operator and the hyperedge Laplace operator for the general setting of chemical hypergraphs, are generalized. In particular, both a vertex
Discrete-to-Continuous Extensions: Lov\'asz extension, optimizations and eigenvalue problems
• Mathematics
• 2021
In this paper, we use various versions of Lovász extension to systematically derive continuous formulations of problems from discrete mathematics. This will take place in the following context: For
Interactions between discrete and continuous optimization and critical point theory via multi-way Lovász extensions
• Mathematics
• 2020
Motivated by the discrete Morse theory, discrete convex analysis and the need of practical application, we introduce and systematically study general discrete-to-continuous extensions, with several

## References

SHOWING 1-10 OF 26 REFERENCES
Spectral Graph Theory
Eigenvalues and the Laplacian of a graph Isoperimetric problems Diameters and eigenvalues Paths, flows, and routing Eigenvalues and quasi-randomness Expanders and explicit constructions Eigenvalues
Spectrum of the 1‐Laplacian and Cheeger's Constant on Graphs
• K. Chang
• Mathematics, Computer Science
J. Graph Theory
• 2016
A nonlinear spectral graph theory is developed, in which the Laplace operator is replaced by the 1 − Laplacian Δ1, and Cheeger's constant equals to the first nonzero Δ1 eigenvalue for connected graphs.
On the spectrum of the normalized graph Laplacian
• Mathematics, Computer Science
• 2007
Spectrum of the Signless 1-Laplacian and the Dual Cheeger Constant on Graphs
• Mathematics
• 2016
Parallel to the signless Laplacian spectral theory, we introduce and develop the nonlinear spectral theory of signless $1$-Laplacian on graphs. Again, the first eigenvalue $\mu^+_1$ of the signless
The $1$-Laplacian Cheeger Cut: Theory and Algorithms
• Computer Science
• 2015
A cell descend (CD) framework for achieving the Cheeger cut based on the graph $1$-Laplacian is proposed, from which both the inverse power method and the steepest descent (SD) method can also be recovered.
Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian
• Mathematics
• 2019
We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that
THE SPECTRUM OF THE 1-LAPLACE OPERATOR
The eigenfunction of the 1-Laplace operator is defined to be a critical point in the sense of the strong slope for a nonsmooth constraint variational problem. We completely write down all these