A graph complexity measure based on the spectral analysis of the Laplace operator

Diego M. Mateos, Federico Morana, Hugo Aimar

In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Pr…