Some Applications of Eigenvalues of Graphs

2010/09/16 by Sebastian M. Cioabă · 1 citation
Mathematics · Physics and Astronomy · Computer Science · #Graph theory and applications #Complex Network Analysis Techniques #Advanced Graph Theory Research #Spectral clustering #Eigenvalues and eigenvectors #Spectral graph theory #Spectral properties #Graph #Cluster analysis #Computer science #Theoretical computer science #Mathematics #Combinatorics #Line graph #Artificial intelligence #Voltage graph #Physics

paper · doi:10.1007/978-0-8176-4789-6_14

openalex publication_date 2010/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

The main goal of spectral graph theory is to relate important structural properties of a graph to its eigenvalues. In this chapter, we survey some old and new applications of spectral methods in graph partitioning, ranking, and epidemic spreading in networks and clustering.

Citations

• Eigenvalues and expanders
• Modern Graph Theory
• Expander graphs and their applications
• Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
• On graphs with equal algebraic and vertex connectivity
• ON EIGENVALUES AND COLORINGS OF GRAPHS, II
• The anatomy of a large-scale hypertextual Web search engine
• Congruent Graphs and the Connectivity of Graphs

Cited by

• Component (graph theory) [wikipedia]