Interlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
Carlos M. da Fonseca · SIAM Journal on Matrix Analysis and Applications · 2005
We extend some interlacing properties of the eigenvalues of tridiagonal matrices to Hermitian matrices whose graph is a tree. We also give a graphical interpretation of the results. We use the work on matchings polynomials by Heilmann and Lieb.