Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods (Q1297416): Difference between revisions
From MaRDI portal
Latest revision as of 20:32, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods |
scientific article |
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
