A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs

DOI10.1016/J.LAA.2005.06.024MaRDI QIDQ2568992zbMATH OpenOpenAlexFDO

Authors R. B. Bapat, Kinkar Ch. Das

Publication date 17 October 2005

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2005.06.024

zbMATH Keywords

Laplacian matrixlargest eigenvalue

Mathematics Subject Classification ID

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

Recommendations

• A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs
• On the bounds for the largest Laplacian eigenvalues of weighted graphs
• Bounds for the largest Laplacian eigenvalue of weighted graphs
• scientific article; zbMATH DE number 7511527
• The characterization of the upper bounds on the largest Laplacian eigenvalue of weighted graphs.
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
• The upper bounds for the largest Laplacian eigenvalue of graphs
• Sharp upper bounds for the Laplacian graph eigenvalues
• New upper bound on the largest Laplacian eigenvalue of graphs

Cites work

• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• A note on Laplacian graph eigenvalues
• An always nontrivial upper bound for Laplacian graph eigenvalues
• An improved upper bound for Laplacian graph eigenvalues
• Eigenvalues of the Laplacian of a graph^∗
• Matrix theory. Basic results and techniques
• On the Laplacian eigenvalues of a graph
• Sharp lower bounds on the Laplacian eigenvalues of trees
• Sharp upper bounds for the Laplacian graph eigenvalues
• The Laplacian Spectrum of a Graph II
• The largest two Laplacian eigenvalues of a graph
• de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph

Cited in

(21)

• Upper bounds of the eigenvalues related to a weighted fractional \(p\)-Laplacian on metric graphs
• Bounds for the largest Laplacian eigenvalue of weighted graphs
• A unified framework for structured graph learning via spectral constraints
• Extremal graph characterization from the bounds of the spectral radius of weighted graphs
• The characterization of the upper bounds on the largest Laplacian eigenvalue of weighted graphs.
• A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs
• scientific article; zbMATH DE number 6383827 (Why is no real title available?)
• scientific article; zbMATH DE number 1484326 (Why is no real title available?)
• On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set
• Lower bounds on the (Laplacian) spectral radius of weighted graphs
• Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
• On the Laplacian spectral radius of weighted trees with fixed diameter and weight set
• The spectral radius of maximum weighted cycle
• A lower bound for the second largest Laplacian eigenvalue of weighted graphs
• On the signless Laplacian spectral radius of weighted digraphs
• Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
• On the spectral radius of weighted unicyclic graphs with a positive weight set
• New bounds and extremal graphs for distance signless Laplacian spectral radius
• On the bounds for the largest Laplacian eigenvalues of weighted graphs
• Bounds on the spectral radii of digraphs in terms of walks
• A sharp upper bound on the spectral radius of weighted graphs

This page was built for publication: A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs

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