The inverse eigenvalue problem for linear trees

We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in [10]. This is the most general class of trees for which the inverse eigenvalue problem has been solved. We explore many consequences, including the Degree Conjecture for possible spectra, upper bounds for the minimum number of eigenvalues of multiplicity 1, and the equality of the diameter of a linear tree and its minimum number of distinct eigenvalues.