An approach to bounding the spectral radius of a weighted digraph

DOI10.1007/s10958-018-3917-7zbMath1394.15012OpenAlexW2810895171WikidataQ129619716 ScholiaQ129619716MaRDI QIDQ1662027

L. Yu. Kolotilina

Publication date: 17 August 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-018-3917-7

zbMATH Keywords

adjacency matrixweighted digraphPerron root of a matrix

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on upper bounds for the spectral radius of weighted graphs
• 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)
• On some metrical properties of operator matrices and matrices partitioned into blocks
• A sharp upper bound on the spectral radius of weighted graphs
• Bounds and inequalities for the Perron root of a nonnegative matrix
• Nonsingularity/singularity criteria for nonstrictly block diagonally dominant matrices.
• Bounds for the greatest characteristic root of a nonnegative matrix
• Recherche d'une \(M\)-matrice parmi les minorantes d'un opérateur linéaire
• Blocs-H-matrices et convergence des méthodes itératives classiques par blocs
• Unzerlegbare, nicht negative Matrizen
• On the spectral radius of weighted digraphs

This page was built for publication: An approach to bounding the spectral radius of a weighted digraph