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

Article

First Online:

Received:

- 60 Downloads
- 1 Citations

## Abstract

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*, 2*t*+1)) (*t* ⩾ 1) are *DQS*, and determine the graphs which have the same signless Laplacian spectrum as *L*(*T*(*t*, *t*, 2*t* + 1)). Let µ_{1}(*G*) be the maximum signless Laplacian eigenvalue of the graph *G*. We give the limit of µ_{1}(*L*(*T*(*a*, *b*, *c*))), too.

## Keywords

signless Laplacian spectrum cospectral graphs*T*-shape tree

## MSC 2010

05C50 15A18## Preview

Unable to display preview. Download preview PDF.

## References

- [1]
*D. M. Cvetković, M. Doob, H. Sachs*: Spectra of Graphs. Theory and Applications (3rd rev. a. enl., ed.). J. A. Barth, Leipzig, 1995.MATHGoogle Scholar - [2]
*D. Cvetković, P. Rowlinson, S. K. Simić*: Signless Laplacians of finite graphs. Linear Algebra Appl.*423*(2007), 155–171.CrossRefMATHMathSciNetGoogle Scholar - [3]
*D. Cvetković, P. Rowlinson, S. K. Simić*: Eigenvalue bounds for the signless Laplacian. Publ. Inst. Math., Nouv. Sér.*81*(2007), 11–27.CrossRefGoogle Scholar - [4]
*D. Cvetković, S. K. Simić*: Towards a spectral theory of graphs based on signless Laplacian. I. Publ. Inst. Math., Nouv. Sér.*85*(2009), 19–33.CrossRefGoogle Scholar - [5]
*D. Cvetković, S. K. Simić*: Towards a spectral theory of graphs based on signless Laplacian. II. Linear Algebra Appl.*432*(2010), 2257–2272.CrossRefMATHMathSciNetGoogle Scholar - [6]
*N. Ghareghani, G. R. Omidi, B. Tayfeh-Rezaie*: Spectral characterization of graphs with index at most \(\sqrt {2 + \sqrt 5 } \). Linear Algebra Appl.*420*(2007), 483–489.CrossRefMATHMathSciNetGoogle Scholar - [7]
*G. R. Omidi*: On a signless Laplacian spectral characterizaiton of*T*-shape trees. Linear Algebra Appl.*431*(2009), 1607–1615.CrossRefMATHMathSciNetGoogle Scholar - [8]
*F. Ramezani, N. Broojerdian, B. Tayfeh-Rezaie*: A note on the spectral characterization of*θ*-graphs. Linear Algebra Appl.*431*(2009), 626–632.CrossRefMATHMathSciNetGoogle Scholar - [9]
*E. R. van Dam, W. H. Haemers*: Which graphs are determined by their spectrum? Linear Algebra Appl. Special issue on the Combinatorial Matrix Theory Conference (Pohang, 2002)*373*(2003), 241–272.MATHGoogle Scholar - [10]
*E. R. van Dam, W. H. Haemers*: Developments on spectral characterizations of graphs. Discrete Math.*309*(2009), 576–586.CrossRefMATHMathSciNetGoogle Scholar - [11]
*J. F. Wang, Q. X. Huang, F. Belardo, E. M. L. Marzi*: On the spectral characterizations of ∞-graphs. Discrete Math.*310*(2010), 1845–1855.CrossRefMATHMathSciNetGoogle Scholar - 12]
*W. Wang, C. X. Xu*: On the spectral characterization of*T*-shape trees. Linear Algebra Appl.*414*(2006), 492–501.CrossRefMATHMathSciNetGoogle Scholar - [13]
*W. Wang, C. X. Xu*: Note: The*T*-shape tree is determined by its Laplacian spectrum. Linear Algebra Appl.*419*(2006), 78–81.CrossRefMATHMathSciNetGoogle Scholar - [14]
*Y. P. Zhang, X. G. Liu, B. Y. Zhang, X. R. Yong*: The lollipop graph is determined by its*Q*-spectrum. Discrete Math.*309*(2009), 3364–3369.CrossRefMATHMathSciNetGoogle Scholar

## Copyright information

© Institute of Mathematics of the Academy of Sciences of the Czech Republic, Praha, Czech Republic 2014