Maximum Steklov Eigenvalue and Algebraic Connectivity of Trees with Given Matching Number
Abstract
This undergraduate essay studies the maximum Steklov eigenvalue and the algebraic connectivity of trees with a given matching number, connecting spectral graph theory with combinatorial structure.
Paper
The full text is available here:
Maximum Steklov eigenvalue and algebraic connectivity of trees with given matching number (PDF)
Related learning notes from the Steklov seminar: