The Laplacian spectra of graphs and complex networks
From MaRDI portal
Publication:3170135
Abstract: The paper is a brief survey of some recent new results and progress of the Laplacian spectra of graphs and complex networks (in particular, random graph and the small world network). The main contents contain the spectral radius of the graph Laplacian for given a degree sequence, the Laplacian coefficients, the algebraic connectivity and the graph doubly stochastic matrix, and the spectra of random graphs and the small world networks. In addition, some questions are proposed.
Recommendations
Cited in
(12)- Investigation and application of Laplace spectra of orgraphs with the ring structure
- Graph spectra for complex networks
- The spectrum of the averaging operator on a network (metric graph)
- Spectra of modular and small-world matrices
- Spectra of generalized compositions of graphs and hierarchical networks
- The Laplacian Spectra of Small-World Networks
- Properties and applications of Laplacian spectra for Koch networks
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
- Spectral plot properties: towards a qualitative classification of networks
- Detection of hubs in complex networks by the Laplacian matrix
- Graph Spectra for Complex Networks
- The spectrum of the graph Laplacian as a tool for analyzing structure and evolution of networks
This page was built for publication: The Laplacian spectra of graphs and complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170135)