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

DOI10.1016/J.LAA.2005.06.024zbMATH Open1072.05039OpenAlexW2024386879MaRDI QIDQ2568992FDOQ2568992

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

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

zbMATH Keywords

Laplacian matrixlargest eigenvalue

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

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

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)