Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs

DOI10.1016/J.LAA.2007.06.018zbMATH Open1124.05062OpenAlexW2042230640MaRDI QIDQ2383016FDOQ2383016

Authors: Kinkar Ch. Das 

Publication date: 5 October 2007

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

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

Recommendations

• 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.
• Bounds for the largest Laplacian eigenvalue of weighted graphs
• The new upper bounds on the spectral radius of weighted graphs
• A sharp upper bound on the spectral radius of weighted graphs

zbMATH Keywords

Laplacian matrixspectral radiusupper boundWeighted graph

Mathematics Subject Classification ID

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

Cites Work

• A note on Laplacian graph eigenvalues
• Two sharp upper bounds for the Laplacian 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
• Maximizing the sum of the squares of the degrees 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
• A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs

Cited In (10)

• Bounds on the spectral radii of digraphs in terms of walks
• On algebraic connectivity as a function of an edge weight
• On the signless Laplacian spectral radius of weighted digraphs
• Extremal graph characterization from the bounds of the spectral radius of weighted graphs
• Lower bounds on the (Laplacian) spectral radius of weighted graphs
• On the bounds for the largest Laplacian eigenvalues of weighted graphs
• Upper bounds on the (signless Laplacian) spectral radius of irregular weighted graphs
• An upper bound on the spectral radius of weighted graphs
• Bounds for the largest Laplacian eigenvalue of weighted graphs
• The characterization of the upper bounds on the largest Laplacian eigenvalue of weighted graphs.

This page was built for publication: Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs

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