Extremal graph characterization from the bounds of the spectral radius of weighted graphs

DOI10.1016/j.amc.2011.02.033zbMath1223.05108OpenAlexW2033140708MaRDI QIDQ535422

Kinkar Chandra Das

Publication date: 11 May 2011

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

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

zbMATH Keywords

upper boundspectral radiusadjacency matrixlower boundweighted graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items (4)

A note on upper bounds for the spectral radius of weighted graphs ⋮ An approach to bounding the spectral radius of a weighted digraph ⋮ On the signless Laplacian spectral radius of weighted digraphs ⋮ The inertia of weighted unicyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Spektren endlicher Grafen
• A sharp upper bound on the spectral radius of weighted graphs
• On the spectral radius of (0,1)-matrices
• Bounds of eigenvalues of graphs
• Bounds on the greatest eigenvalue of graphs.
• A bound on the spectral radius of graphs with \(e\) edges
• Some new bounds on the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• 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

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