An eigenvalue bound for the Laplacian of a graph

DOI10.1016/j.disc.2005.06.017zbMath1073.05042OpenAlexW1977994523MaRDI QIDQ2570118

J. P. Grossman

Publication date: 26 October 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.06.017

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

The normalized distance Laplacian ⋮ Correction to: ``Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme. A remark on normalized Laplacian eigenvalues of signed graph ⋮ Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme

Cites Work

• Unnamed Item
• Unnamed Item
• Diameters and Eigenvalues
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian

This page was built for publication: An eigenvalue bound for the Laplacian of a graph