Browse > Article
http://dx.doi.org/10.4134/BKMS.2008.45.1.095

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES  

Kim, In-Jae (DEPARTMENT OF MATHEMATICS AND STATISTICS MINNESOTA STATE UNIVERSITY)
Shader, Bryan L. (DEPARTMENT OF MATHEMATICS UNIVERSITY OF WYOMING)
Publication Information
Bulletin of the Korean Mathematical Society / v.45, no.1, 2008 , pp. 95-99 More about this Journal
Abstract
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.
Keywords
acyclic matrix; Parter-vertex; simple eigenvalue;
Citations & Related Records

Times Cited By Web Of Science : 1  (Related Records In Web of Science)
Times Cited By SCOPUS : 1
연도 인용수 순위
1 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   DOI   ScienceOn
2 C. Godsil and G. Royle, Algebraic graph theory, Graduate Texts in Mathematics, 207. Springer-Verlag, New York, 2001
3 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
4 R. Horn and C. R. Johnson, Matrix analysis, Cambridge University Press, Cambridge, 1985
5 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   DOI   ScienceOn