1926-2015. Czech mathematician.
Introduced algebraic connectivity (1973): the second-smallest eigenvalue of the graph Laplacian, now called the Fiedler value.
Proved that the Fiedler value measures how well-connected a graph is — zero means disconnected, larger values mean more robust connectivity.
The corresponding Fiedler vector provides optimal graph partitioning, widely used in spectral clustering and community detection.
His spectral approach to graph structure is foundational for the cyber tri-kernel: the graph Laplacian $L = D - A$ encodes the structural constraints that the spring kernel operates on.
Member of the Czech Academy of Sciences, working on matrix theory, linear algebra, and combinatorics for over six decades.