Spectral characterization of trees.
No Thumbnail Available
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Saudi Digital Library
Abstract
The eigenvalues of a graph are the eigenvalues of its adjacency matrix. Let ?1and ?2 denote the largest and the second largest eigenvalue, respectively. The family of trees having only three end vertices and satisfying a certain equality involving ?1and ?2 is characterized. Also, bounds on ?2 for the above family of trees are investigated.