A discrete nodal domain theorem for trees

Linear Algebra and Its Applications

Volumn 360, Issue , 2003, Pages 197-205

  Biyikoǧlu, Türker ^a,b  

^a VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS   (Austria)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

Discretenodaldomaintheorem; Eigenvectorsofamatrixwithnon positiveoff diagonalelements; Graph Laplacian; Sign graph; Tree

Indexed keywords

EID: 84867931105     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00451-2     Document Type: Article

References (5)

1. E.B. Davies, G.M.L. Gladwell, J. Leydold, and P.F. Stadler Discrete nodal domain theorems Linear Algebra Appl. 336 2001 51 60
2. I. Faria Permanental roots and the star degree of a graph Linear Algebra Appl. 64 1985 255 265
3. M. Fiedler Eigenvectors of acyclic matrices Czechoslovak Math. J. 25 1975 607 618
4. M.R. Garey, and D.S. Johnson Computers and Intractability. A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco
5. R. Roth On the eigenvectors belonging to the minimum eigenvalues of an essentially nonnegative symmetric matrix with bipartite graph Linear Algebra Appl. 118 1989 1 10