Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph (Q409384)
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: Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph |
scientific article; zbMATH DE number 6023613
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph |
scientific article; zbMATH DE number 6023613 |
Statements
Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph (English)
0 references
13 April 2012
0 references
distance matrix
0 references
spectral radius
0 references
principal eigenvector
0 references
diameter of a graph
0 references
0 references
0 references
0 references
0.9371585
0 references
0.9299088
0 references
0 references
0.88192934
0 references
0.8779079
0 references
0.8778893
0 references
0.8729022
0 references
0 references
