Skip to main content
Log in

Laplacian spectral characterization of some graph join

  • Published:
Indian Journal of Pure and Applied Mathematics Aims and scope Submit manuscript

Abstract

For two disjoint graphs G and H, the join of G and H, denoted by GH, is the graph obtained from GH by joining each vertex of G to each vertex of H. A graph is said to be DLS if there is no other non-isomorphic graph with the same Laplacian spectrum. For a connected DLS graph G with a cut vertex, we prove that GK r is DLS, where K r is a complete graph. For a disconnected DLS graph G with n ⩾ 10 vertices and mn — 4 edges, we show that G ∨ (K r e) is DLS, where K r e is the graph obtained by deleting one edge of K r . Applying these results we can obtain new DLS graphs.

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. C. Bu and J. Zhou, Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra, Linear Algebra Appl., 436 (2012), 143–151.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Cvetković, P. Rowlinson and S. Simić, An Introduction to the Theory of Graph Spectra. Cambridge University Press. Cambridge, 2010.

    MATH  Google Scholar 

  3. D. Cvetković, S. Simic and Z. Stanić, Spectral determination of graphs whose components are paths and cycles, Comput. Math. Appl., 59 (2010), 3849–3857.

    Article  MATH  MathSciNet  Google Scholar 

  4. E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl., 373 (2003), 241–272.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Fiedler, Algebraic connectivity of graphs, Czech. Math. J., 23 (98) (1973), 298–305.

    MathSciNet  Google Scholar 

  7. R. Grone and R. Merris, The Laplacian spectrum of a graph, II, SIAM J. Discrete Math., 7 (1994), 221–229.

    Article  MATH  MathSciNet  Google Scholar 

  8. G. Guo and G. Wang, On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs, Linear Algebra Appl., 438 (2013), 4595–4605.

    Article  MATH  MathSciNet  Google Scholar 

  9. S.J. Kirkland, J.J. Molitierno, M. Neumann and B.L. Shader, On graphs with equal algebraic and vertex connectivity, Linear Algebra Appl., 341 (2002), 45–56.

    Article  MATH  MathSciNet  Google Scholar 

  10. Y. Lin, J. Shu and Y. Meng, Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs, Comput. Math. Appl., 60 (2010), 2003–2008.

    Article  MATH  MathSciNet  Google Scholar 

  11. M.H. Liu, Some graphs determined by their (signless) Laplacian spectra, Czech. Math. J., 62 (137) (2012), 1117–1134.

    Article  MATH  Google Scholar 

  12. M.H. Liu, B.L. Liu and F.Y. Wei, Graphs determined by their (signless) Laplacian spectra, Electron. J. Linear Algebra, 22 (2011), 112–124.

    MATH  MathSciNet  Google Scholar 

  13. X. Liu and S. Wang, Laplacian spectral characterization of some graph products, Linear Algebra Appl., 437 (2012), 1749–1759.

    Article  MATH  MathSciNet  Google Scholar 

  14. X. Liu, Y. Zhang and X. Gui, The multi-fan graphs are determined by their Laplacian spectra, Discrete Math., 308 (2008), 4267–4271.

    Article  MATH  MathSciNet  Google Scholar 

  15. G.R. Omidi, On a Laplacian spectral characterization of graphs of index less than 2, Linear Algebra Appl., 429 (2008), 2724–2731.

    Article  MATH  MathSciNet  Google Scholar 

  16. X. Shen, Y. Hou and Y. Zhang, Graph Zn and some graphs related to Zn are determined by their spectrum, Linear Algebra Appl., 404 (2005), 58–68.

    Article  MATH  MathSciNet  Google Scholar 

  17. S. Simić and Z. Stanić, On some forests determined by their Laplacian or signless Laplacian spectrum, Comput. Math. Appl., 58 (2009), 171–178.

    Article  MATH  MathSciNet  Google Scholar 

  18. J.F. Wang, S. Simić, Q.X. Huang, F. Belardo and E.M. Li Marzi, Laplacian spectral characterization of disjoint union of paths and cycles, Linear and Multilinear Algebra, 59 (2011), 531–539.

    Article  MATH  MathSciNet  Google Scholar 

  19. X.L. Zhang and H.P. Zhang, Some graphs determined by their spectra, Linear Algebra Appl., 431 (2009), 1443–1454.

    Article  MATH  MathSciNet  Google Scholar 

  20. Y. Zhang, X. Liu and X. Yong, Which wheel graphs are determined by their Laplacian spectra?, Comput. Math. Appl., 58 (2009), 1887–1890.

    Article  MATH  MathSciNet  Google Scholar 

  21. J. Zhou and C. Bu, Laplacian spectral characterization of some graphs obtained by product operation, Discrete Math., 312 (2012), 1591–1595.

    Article  MATH  MathSciNet  Google Scholar 

  22. J. Zhou and C. Bu, Spectral characterization of line graphs of starlike trees, Linear and Multilinear Algebra, 61 (2013), 1041–1050.

    Article  MATH  MathSciNet  Google Scholar 

  23. D. Zhu, On upper bounds for Laplacian graph eigenvalues, Linear Algebra Appl., 432 (2010), 2764–2772.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiang Zhou.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, L., Wang, W., Zhou, J. et al. Laplacian spectral characterization of some graph join. Indian J Pure Appl Math 46, 279–286 (2015). https://doi.org/10.1007/s13226-015-0124-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13226-015-0124-9

Keywords

Navigation