Login / Signup
Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods.
Juan A. Rodríguez-Velázáuez
José Luis Andres Yebra
Published in:
Discret. Math. (1999)
Keyphrases
</>
adjacency matrix
graph representation
laplacian matrix
connected components
spectral clustering
graph partitioning
graph clustering
high dimensional
upper bound
spectral methods