Eigenvalue comparison theorems of the discrete Laplacians for a graph

DOI10.1023/A:1005008324245zbMath0921.58067OpenAlexW7734153MaRDI QIDQ1282293

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

first eigenvalueLaplacianinfinite graphsCheng's theorem

Mathematics Subject Classification ID

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

Related Items (6)

A spectral property of discrete Schrödinger operators with non-negative potentials ⋮ Heat kernel and Green kernel comparison theorems for infinite graphs ⋮ Volume growth, spectrum and stochastic completeness of infinite graphs ⋮ The dual Cheeger constant and spectra of infinite graphs ⋮ Ordering trees by the spectral radius of Laplacian ⋮ On the discrete version of Picone's identity

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