A tight upper bound on the spectral radius of bottleneck matrices for graphs (Q2002805): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2018.03.044 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2794787351 / rank | |||
Normal rank | |||
Revision as of 23:00, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight upper bound on the spectral radius of bottleneck matrices for graphs |
scientific article |
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
