Stevanović, Dragan; Brankov, Vladimir Some trees characterized by eigenvalues and angles. (English) Zbl 1121.05075 Publ. Inst. Math., Nouv. Sér. 79(93), 19-27 (2006). A vertex of a simple graph is called large if its degree is at least 3. It was shown recently that in the class of starlike trees, which have one large vertex, there are no pairs of cospectral trees. However, already in the classes of trees with two or three large vertices there exist pairs of cospectral trees. Thus, one needs to employ an additional graph invariant in order to characterize such trees. Here it is shown that trees with two or three large vertices are characterized by their eigenvalues and angles. Reviewer: Mirko Lepović (Kragujevac) Cited in 1 Document MSC: 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.) Keywords:starlike trees PDFBibTeX XMLCite \textit{D. Stevanović} and \textit{V. Brankov}, Publ. Inst. Math., Nouv. Sér. 79(93), 19--27 (2006; Zbl 1121.05075) Full Text: DOI EuDML