On nonsingular trees and a reciprocal eigenvalue property

Linear and Multilinear Algebra

Volumn 54, Issue 6, 2006, Pages 453-465

  Barik, S ^a   Neumann, M ^b   Pati, S ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Adjacency matrix; Alternating path; Inverse graph; Property (R); Property (SR); Tree

Indexed keywords

EID: 33748650570     PISSN: 03081087     EISSN: 15635139     Source Type: Journal    
DOI: 10.1080/03081080600792897     Document Type: Article

References (9)

1. Barik, S., Pati, S. and Sarma, B.K., The spectrum of the corona of two graphs (To appear in SIAM J. on Discrete Math).
2. Buckly, F., Doty, L.L. and Harary, F., 1998, On graphs with signed inverses. Networks, 18, 151-157.
3. Cvetkovic, D.M., Doob, M. and Sachs, H., 1979, Spectra of Graphs (New York: Academic Press).
4. Frucht, R. and Harary, F., 1970, On the corona of two graphs. Aequationes Mathematics, 4, 322-325.
5. Guo, J.M. and Shao, J.Y., 2006, On the spectral radius of trees with fixed diameter. Linear Algebra and its Applications, 413:131-147.
6. Gregory, R.T. and Karney, D.L., 1969, A Collection of Matrices for Testing Computational Algorithms (New York: Wiley-Interscience).
7. Lewin, M. and Neumann, M., 1980, On the inverse M-matrix problem for (0, 1)-matrices. Linear Algebra and its Applications, 30, 41-50.
8. Pavlikova, S. and krc-jediny, J., 1990, On the inverse and dual index of a tree. Linear and Multilinear Algebra, 28, 93-109.
9. Xu, G.H., 1997, On the spectral radius of trees with perfect matchings. Combinatorics and Graph Theory (Singapore: World Scientific).