A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory

@article{Fiedler1975APO,
  title={A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory},
  author={Miroslav Fiedler},
  journal={Czechoslovak Mathematical Journal},
  year={1975},
  volume={25},
  pages={619-633}
}
  • M. Fiedler
  • Published 1975
  • Mathematics
  • Czechoslovak Mathematical Journal
A game of alignment: Collective behavior of multi-species
  • Si-ming He, E. Tadmor
  • Computer Science
    Annales de l'Institut Henri Poincaré C, Analyse non linéaire
  • 2021
Vertex-connectivity and eigenvalues of graphs
Türker Biyikoglu and Josef Leydold Algebraic Connectivity and Degree Sequences of Trees
We investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are
On the maximal error of spectral approximation of graph bisection
TLDR
It is proved that the standard spectral graph bisection can produce bisections that are far from optimal, and it is shown that the maximum error in the spectral approximation of the optimal bisection (partition sizes exactly equal) cut for such graphs is bounded below by a constant multiple of the order of the graph squared.
Spectral methods for graph clustering - A survey
The smallest values of algebraic connectivity for unicyclic graphs
Algebraic Connectivity and Degree Sequences of Trees
...
...