- Volume 45 Issue 1
It is known that each eigenvalue of a real symmetric, irreducible, tridiagonal matrix has multiplicity 1. The graph of such a matrix is a path. In this paper, we extend the result by classifying those trees for which each of the associated acyclic matrices has distinct eigenvalues whenever the diagonal entries are distinct.
acyclic matrix;Parter-vertex;simple eigenvalue
- A. Leal Duarte and C. R. Johnson, On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree, Math. Inequal. Appl. 5 (2002), no. 2, 175-180
- R. Horn and C. R. Johnson, Matrix analysis, Cambridge University Press, Cambridge, 1985
- C. R. Johnson and A. Leal Duarte, The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, Linear and Multilinear Algebra 46 (1999), no. 1-2, 139-144 https://doi.org/10.1080/03081089908818608
- C. Godsil and G. Royle, Algebraic graph theory, Graduate Texts in Mathematics, 207. Springer-Verlag, New York, 2001
- C. R. Johnson, A. Leal Duarte, and C. M. Saiago, The Parter-Wiener theorem: refinement and generalization, SIAM J. Matrix Anal. Appl. 25 (2003), no. 2, 352-361 https://doi.org/10.1137/S0895479801393320