Skip to main content
Log in

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

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

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, 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 µ1(G) be the maximum signless Laplacian eigenvalue of the graph G. We give the limit of µ1(L(T(a, b, c))), too.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

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.

    MATH  Google Scholar 

  2. D. Cvetković, P. Rowlinson, S. K. Simić: Signless Laplacians of finite graphs. Linear Algebra Appl. 423 (2007), 155–171.

    Article  MATH  MathSciNet  Google 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.

    Article  Google 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.

    Article  Google 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.

    Article  MATH  MathSciNet  Google 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.

    Article  MATH  MathSciNet  Google Scholar 

  7. G. R. Omidi: On a signless Laplacian spectral characterizaiton of T-shape trees. Linear Algebra Appl. 431 (2009), 1607–1615.

    Article  MATH  MathSciNet  Google Scholar 

  8. F. Ramezani, N. Broojerdian, B. Tayfeh-Rezaie: A note on the spectral characterization of θ-graphs. Linear Algebra Appl. 431 (2009), 626–632.

    Article  MATH  MathSciNet  Google 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.

    MATH  Google Scholar 

  10. E. R. van Dam, W. H. Haemers: Developments on spectral characterizations of graphs. Discrete Math. 309 (2009), 576–586.

    Article  MATH  MathSciNet  Google 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.

    Article  MATH  MathSciNet  Google Scholar 

  12. W. Wang, C. X. Xu: On the spectral characterization of T-shape trees. Linear Algebra Appl. 414 (2006), 492–501.

    Article  MATH  MathSciNet  Google 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.

    Article  MATH  MathSciNet  Google 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.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guoping Wang.

Additional information

This work is supported by NSFC Grants No. 11261059 and No. 11461071.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, G., Guo, G. & Min, L. On the signless Laplacian spectral characterization of the line graphs of T-shape trees. Czech Math J 64, 311–325 (2014). https://doi.org/10.1007/s10587-014-0103-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10587-014-0103-z

Keywords

MSC 2010

Navigation