On the signless Laplacian spectral characterization of the line graphs of T-shape trees

A graph is determined by its signless Laplacian spectrum if no other nonisomorphic graph has the same signless Laplacian spectrum (simply G is DQS). Let T (a, b, c) denote the T-shape tree obtained by identifying the end vertices of three paths P _a+2, P _b+2 and P _c+2. We prove that its all line graphs L(T(a, b, c)) except L(T(t, t, 2t+1)) (t ? 1) are DQS, and determine the graphs which have the same signless Laplacian spectrum as L(T(t, t, 2t + 1)). Let µ₁(G) be the maximum signless Laplacian eigenvalue of the graph G. We give the limit of µ₁(L(T(a, b, c))), too.