Extremal inverse eigenvalue problem for irreducible acyclic matrices
Extremal inverse eigenvalue problem for irreducible acyclic matrices
In this paper, we study the inverse eigenvalue problem of constructing symmetric matrices whose graph is a tree, i.e. of constructing irreducible acyclic matrices from given eigendata consisting of the smallest and largest eigenvalues of their leading principal submatrices. We solve the problem completely for the case when the given …