Eigenvalue comparison theorems of the discrete Laplacians for a graph

DOI10.1023/A:1005008324245MaRDI QIDQ1282293zbMATH OpenOpenAlexFDO

Authors Hajime Urakawa

Publication date 26 September 1999

Published in Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005008324245

zbMATH Keywords

Cheng's theoremfirst eigenvalueinfinite graphsLaplacian

Mathematics Subject Classification ID

Trees (05C05) Isoperimetric problems for polytopes (52B60) Spectral problems; spectral geometry; scattering theory on manifolds (58J50) Graph theory (including graph drawing) in computer science (68R10)

Review text

The author gives a graph theoretic version of Cheng's eigenvalue comparison theorems for the Laplacian on complete Riemannian manifolds. He also determines the infimum of the essential spectrum of the discrete Laplacian on infinite graphs.

Recommendations

• scientific article; zbMATH DE number 2191998
• Eigenvalues of Graphs and Sobolev Inequalities
• The Spectrum of an Infinite Graph

Cited in

(10)

• Heat kernel and Green kernel comparison theorems for infinite graphs
• Ordering trees by the spectral radius of Laplacian
• On the displacement of eigenvalues when removing a twin vertex
• A spectral property of discrete Schrödinger operators with non-negative potentials
• The dual Cheeger constant and spectra of infinite graphs
• On the discrete version of Picone's identity
• Volume growth, spectrum and stochastic completeness of infinite graphs
• Eigenvalue Comparison Theorems of Neumann Laplacian for Graphs.
• Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
• Quasi-linear criticality theory and Green's functions on graphs

This page was built for publication: Eigenvalue comparison theorems of the discrete Laplacians for a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1282293)