Eigenvalues of Graphs

Fan R. K. Chung
Additional contact information
Fan R. K. Chung: University of Pennsylvania, Department of Mathematics

A chapter in Proceedings of the International Congress of Mathematicians, 1995, pp 1333-1342 from Springer

Abstract: Abstract The study of eigenvalues of graphs has a long history. Since the early days, representation theory and number theory have been very useful for examining the spectra of strongly regular graphs with symmetries. In contrast, recent developments in spectral graph theory concern the effectiveness of eigenvalues in studying general (unstructured) graphs. The concepts and techniques, in large part, use essentially geometric methods.(Still, extremal and explicit constructions are mostly algebraic [20].) There has been a significant increase in the interaction between spectral graph theory and many areas of mathematics as well as other disciplines, such as physics, chemistry, communication theory, and computer sciences.

Date: 1995
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-3-0348-9078-6_128

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

DOI: 10.1007/978-3-0348-9078-6_128

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 ().