A tight upper bound on the spectral radius of bottleneck matrices for graphs (Q2002805)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A tight upper bound on the spectral radius of bottleneck matrices for graphs |
scientific article; zbMATH DE number 7080290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight upper bound on the spectral radius of bottleneck matrices for graphs |
scientific article; zbMATH DE number 7080290 |
Statements
A tight upper bound on the spectral radius of bottleneck matrices for graphs (English)
0 references
12 July 2019
0 references
Laplacian matrix
0 references
bottleneck matrix
0 references
algebraic connectivity
0 references
vertex eccentricity
0 references
