The Art of Discrete and Applied Mathematics · 2019 · 70 citations · 49 references
Natural SciencesMathematicsCombinatoricsNumber TheoryRepresentation TheoryGraph AlgorithmsGraph TheorySpectral AnalysisSpectral MethodsSpectral TheoryAdjacency MatricesSigned GraphsSpectral Graph Theory
Signed graphs are graphs whose edges get a sign +1 or −1 (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much attention from graph spectra specialists. One motivation is that the spectral theory of signed graphs elegantly generalizes the spectral theories of unsigned graphs. On the other hand, unsigned graphs do not disappear completely, since their role can be taken by the special case of balanced signed graphs. Therefore, spectral problems defined and studied for unsigned graphs can be considered in terms of signed graphs, and sometimes such generalization shows nice properties which cannot be appreciated in terms of (unsigned) graphs. Here, we survey some general results on the adjacency spectra of signed graphs, and we consider some spectral problems which are inspired from the spectral theory of (unsigned) graphs.
49
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, Avi Wigderson · Bulletin of the American Mathematical Society · 2006 · 1.8K citations · Full text
Epidemic spreading in real networks: an eigenvalue viewpoint
Yang Wang, Deepayan Chakrabarti, Chenxi Wang et al. · 2004 · 865 citations · Full text
Veterinary Medicine, Infectious Diseases, Complex Systems +15
Thomas Zasĺavsky · Discrete Applied Mathematics · 1982 · 540 citations
Theory of monomer-dimer systems
Ole J. Heilmann, Élliott H. Lieb · Communications in Mathematical Physics · 1972 · 510 citations
On the second eigenvalue of a graph
A. Nilli · Discrete Mathematics · 1991 · 317 citations