DOI QR코드

DOI QR Code

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)
  • Published : 2008.02.29

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

References

  1. 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
  2. C. Godsil and G. Royle, Algebraic graph theory, Graduate Texts in Mathematics, 207. Springer-Verlag, New York, 2001
  3. R. Horn and C. R. Johnson, Matrix analysis, Cambridge University Press, Cambridge, 1985
  4. 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
  5. 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

Cited by

  1. The maximum number of P-vertices of some nonsingular double star matrices vol.313, pp.20, 2013, https://doi.org/10.1016/j.disc.2013.05.018
  2. Nonsingular acyclic matrices with full number of P-vertices vol.61, pp.1, 2013, https://doi.org/10.1080/03081087.2012.661425