On the Spectral Determination of Complements of \(T\)-shape Trees
Feifan Gong, Kehua Wang, Wei Wang
Abstract
A graph \(G\) is said to be determined by its spectrum if every graph cospectral with \(G\) is isomorphic to \(G\). A T-shape tree is defined as a tree containing exactly one vertex of maximum degree three. For any three positive integers \(1\),\(2\) and \(3\) with \( 1≤ 2≤ 3\), we denote by \(T(1,2,3)\) the unique \(T\)-shape tree such that deleting its degree-three vertex \(v\) yields three disjoint paths \(P_1\), \(P_2\), and \(P_3\), i.e., \(T(1,2,3)-v = P_1 P_2 P_3\), where \(Pk\) stands for the path graph on \(k\) vertices. In this paper, we establish a complete spectral characterization for the complements of \(T\)-shape trees, settling a long-standing conjecture posed by Wang and Xu (2006). Specifically, we prove that the complement of \(T(1,2,3)\) is spectrally determined if and only if \((1,2,3) \(,,2-2):2\\). Moreover, all cospectral mates of the complement of the \(T\)-shape tree \(T(,,2-2)\) are identified for every integer \(≥ 2\).
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato