A graph is said to be \emph{determined by its spectrum} if every graph cospectral with is isomorphic to . A \emph{T-shape tree} is defined as a tree containing exactly one vertex of maximum degree three. For any three positive integers , and with , we denote by the unique -shape tree such that deleting its degree-three vertex yields three disjoint paths , , and , i.e., , where stands for the path graph on vertices. In this paper, we establish a complete spectral characterization for the complements of -shape trees, settling a long-standing conjecture posed by Wang and Xu (2006). Specifically, we prove that the complement of is spectrally determined if and only if . Moreover, all cospectral mates of the complement of the -shape tree are identified for every integer .

生成讲解博客的中文版本

生成AI智能校验的中文版本