A tight upper bound on the spectral radius of bottleneck matrices for graphs
type: Item
instance of: scholarly article
title: A tight upper bound on the spectral radius of bottleneck matrices for graphs
zbMATH Open document ID: 1416.05176
author: Jason J. Molitierno
published in: Linear Algebra and its Applications
publication date: 2019-07-12T00:00:00Z
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 7080290
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: bottleneck matrix
zbMATH Keywords: algebraic connectivity
zbMATH Keywords: vertex eccentricity
MaRDI profile type: Publication
full work available at URL: j.laa.2018.03.044
OpenAlex ID: W2794787351
cites work: Q4326384
cites work: Old and new results on algebraic connectivity of graphs
cites work: Extremizing algebraic connectivity subject to graph theoretic constraints
cites work: Q5682350
cites work: Q3877805
cites work: Q4729804
cites work: Matrix Analysis
cites work: Algebraic connectivity of weighted trees under perturbation
cites work: Characteristic vertices of weighted trees via perron values
cites work: Distances in Weighted Trees and Group Inverse of Laplacian Matrices
cites work: Laplacian matrices of graphs: A survey
DOI: 10.1016/J.LAA.2018.03.044
description: scientific article; zbMATH DE number 7080290