Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods (Q1297416)
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: Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods |
scientific article; zbMATH DE number 1321781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods |
scientific article; zbMATH DE number 1321781 |
Statements
Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods (English)
0 references
9 August 1999
0 references
The paper compares some recent bounds on the diameter and mean distance of graphs in terms of the eigenvalues of either the adjacency matrix or the Laplacian matrix of the graph.
0 references
diameter
0 references
mean distance
0 references
eigenvalues
0 references
adjacency matrix
0 references
Laplacian matrix
0 references
0 references
0 references
0.9299331
0 references
0.9293945
0 references
0.92483616
0 references
0.91244686
0 references
0 references
0.9096301
0 references
0.9083826
0 references
0.90540326
0 references
0 references
