Drawing weighted directed graph from it’s adjacency matrix

Bounding the diameter and the mean dista

Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods

✍ J.A. Rodríguez; J.L.A. Yebra 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Recently, several results bounding above the diameter and/or the mean distance of a graph from its eigenvalues have been presented. They use the eigenvalues of either the adjacency or the Laplacian matrix of the graph. The main object of this paper is to compare both methods. As expected, they are e