A note on upper bounds for the spectral radius of weighted graphs

DOI10.1016/j.amc.2014.05.106zbMath1335.05116OpenAlexW2029921544MaRDI QIDQ279923

Gui-Xian Tian, Ting-Zhu Huang

Publication date: 29 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.05.106

zbMATH Keywords

upper boundspectral radiusadjacency matrixweighted graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (2)

An approach to bounding the spectral radius of a weighted digraph ⋮ Upper bounds on the (signless Laplacian) spectral radius of irregular weighted graphs

Cites Work

• The new upper bounds on the spectral radius of weighted graphs
• Extremal graph characterization from the bounds of the spectral radius of weighted graphs
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Bounds on the (Laplacian) spectral radius of graphs
• A sharp upper bound on the spectral radius of weighted graphs
• On the spectral radius of graphs
• Some new bounds on the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Bounds for the (Laplacian) spectral radius of graphs with parameter α
• Matrix Analysis
• Unnamed Item

This page was built for publication: A note on upper bounds for the spectral radius of weighted graphs