Some Applications of Eigenvalues of Graphs

Sebastian M. Cioabă ()
Additional contact information
Sebastian M. Cioabă: University of Delaware, Department of Mathematical Sciences

Chapter Chapter 14 in Structural Analysis of Complex Networks, 2011, pp 357-379 from Springer

Abstract: 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.

Keywords: Eigenvalues; Graph; Partition; Laplacian (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-4789-6_14

Ordering information: This item can be ordered from
http://www.springer.com/9780817647896

DOI: 10.1007/978-0-8176-4789-6_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().