The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree

DOI10.1137/130931692zbMath1320.15005OpenAlexW947357996MaRDI QIDQ5499735

Leon Zhang, Miriam Farber, Charles R. Johnson

Publication date: 31 July 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/100552

zbMATH Keywords

Hermitian matriceseigenvaluestreesparter verticesinterlacing equalities

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (1)

Inverse spectral problems for collections of leading principal submatrices of tridiagonal matrices

Cites Work

• Spectral multiplicity and splitting results for a class of qualitative matrices
• Construction of acyclic matrices from spectral data
• Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• Matrix Analysis
• The Parter--Wiener Theorem: Refinement and Generalization
• Interlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree