On the spectrum of the normalized graph Laplacian

Abstract

The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this spectrum under local and global operations like motif doubling, graph joining or splitting. The eigenvalue 1 plays a particular role, and we therefore emphasize those constructions that change its multiplicity in a controlled manner, like the iterated duplication of nodes.

9 pages, no figures

Cited by in corpus (7)

• Spectral properties of complex networks
• Spectral plots and the representation and interpretation of biological data
• Spectral Theory of Laplace Operators on Oriented Hypergraphs
• Effect on normalized graph Laplacian spectrum by motif attachment and duplication
• On the normalized spectrum of threshold graphs
• Graph spectra as a systematic tool in computational biology
• Characteristics polynomial of normalized Laplacian for trees