Abstract
A graph can be associated with several matrices, whose eigenvalues reflect structural properties of the graph. The adjacency matrix, the Laplacian, and the normalized Laplacian are in the main focus of spectral studies. How can the spectrum be used to analyze a graph?
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Baltz, A., Kliemann, L. (2005). Spectral Analysis. In: Brandes, U., Erlebach, T. (eds) Network Analysis. Lecture Notes in Computer Science, vol 3418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31955-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-31955-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24979-5
Online ISBN: 978-3-540-31955-9
eBook Packages: Computer ScienceComputer Science (R0)