|Born||7 April 1926
|Died||20 November 2015(aged 89)|
|Institutions||Institute of Computer Science, The Czech Academy of Sciences|
|Alma mater||Charles University, Prague|
His article, "Algebraic Connectivity of Graphs", published in the Czechoslovak Math Journal in 1973, established the use of the eigenvalues of the Laplacian matrix of a graph to create tools for measuring algebraic connectivity in algebraic graph theory. Since then, this structure has become essential to large areas of research in flocking, distributed control, clustering and image segmentation.
- Algebraic connectivity of graphs. Czechoslovak Math. J. 23(98):298 - 305 (1973).
- prof. RNDr. Miroslav Fiedler, DrSc. (Czech)