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

DOI10.1016/j.laa.2018.03.044zbMath1416.05176OpenAlexW2794787351MaRDI QIDQ2002805

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Old and new results on algebraic connectivity of graphs
• Laplacian matrices of graphs: A survey
• Characteristic vertices of weighted trees via perron values
• Matrix Analysis
• Algebraic connectivity of weighted trees under perturbation
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• Extremizing algebraic connectivity subject to graph theoretic constraints

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