On the spectral characterization of T-shape trees

A graph G is said to be determined by its spectrum if any graph having the same spectrum as G is isomorphic to G. A T-shape is a tree with exactly one of its vertices having maximal degree 3. In this paper, we show that all T-shape trees are determined by their spectra, except for a few well-defined cases.