Perron-Frobenius type results and discrete versions of nodal domain theorems

Linear Algebra and Its Applications

Volumn 294, Issue 1-3, 1999, Pages 259-268

  Duval, Art M ^a   Reiner, Victor ^b  

^a UNIVERSITY OF TEXAS AT EL PASO   (United States)

^b University of Minnesota   (United States)

Author keywords

Graph Laplacian; Nodal domain

Indexed keywords

EID: 0033460530     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(99)00090-7     Document Type: Article

References (6)

1. R. Courant, D. Hilbert, Methods of Mathematical Physics, vol. 1, Interscience, New York, 1953.
2. M. Fiedler, Algebraic connectivity of graphs, Czech. Math. J. 23 (1973) 298-305.
3. M. Fiedler, A property of eigenvectors of non-negative symmetric matrices and its application to graph theory, Czech. Math. J. 25 (1975) 619-633.
4. R. Horn, C. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1985.
5. R. Merris, Laplacian matrices of graphs: a survey, Linear Algebra Appl. 1978 (1994) 143-176.
6. A. Pleijel, Remarks on Courant's nodal line theorem, Commun. Pure Appl. Math. 9 (1956) 543-550.