A tight upper bound on the spectral radius of bottleneck matrices for graphs

DOI10.1016/J.LAA.2018.03.044MaRDI QIDQ2002805zbMATH OpenOpenAlexFDO

Authors Jason J. Molitierno

Publication date 12 July 2019

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

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

zbMATH Keywords

Laplacian matrixalgebraic connectivityvertex eccentricitybottleneck matrix

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1279785
• scientific article; zbMATH DE number 1877024
• Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and its applications
• Sharp bounds on the spectral radius and the energy of graphs
• Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs

Cites work

• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 4114654 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Algebraic connectivity of weighted trees under perturbation
• Characteristic vertices of weighted trees via perron values
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Laplacian matrices of graphs: A survey
• Matrix Analysis
• Old and new results on algebraic connectivity of graphs

Cited in

(2)

• Eigenvectors in Bottleneck algebra
• Strictly monotone sequences of lower and upper bounds on Perron values and their combinatorial applications

This page was built for publication: A tight upper bound on the spectral radius of bottleneck matrices for graphs

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