Bounds for the largest Laplacian eigenvalue of weighted graphs

DOI10.1155/2013/520610zbMath1267.05165OpenAlexW2001222149WikidataQ58923548 ScholiaQ58923548MaRDI QIDQ1953663

Sezer Sorgun

Publication date: 10 June 2013

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/520610

zbMATH Keywords

upper boundweighted graphsLaplacian eigenvaluesLaplacian matrices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Cites Work

• On the bounds for the largest Laplacian eigenvalues of weighted graphs
• Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
• A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
• Matrix Analysis
• Eigenvalues of the Laplacian of a graph^∗

This page was built for publication: Bounds for the largest Laplacian eigenvalue of weighted graphs