Spectral graph theory

By A. Hinge. 2019

2,822 citations recorded by the source corpus.

Spectral graph theory is a vast and expanding area of combinatorics. We start these notes by introducing and motivating classical matrices associated with a graph, and then show how to derive combinatorial properties of a graph from the eigenvalues of these matrices. We then examine more modern results such as polynomial interlacing and high dimensional expanders

Subfields: Geometry and Topology

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Geometry and Topology

  1. Michael M. Bronstein
  2. Michaël Defferrard
  3. Xavier Bresson
  4. Jiaoyang Huang
  5. Pierre Vandergheynst
  6. Vladimir Braverman
  7. Renjie Liao
  8. Raquel Urtasun

Citations in the corpus