IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v443y2023ics0096300322008554.html
   My bibliography  Save this article

On distance Laplacian spectral determination of complete multipartite graphs

Author

Listed:
  • Rakshith, B.R.
  • Das, Kinkar Chandra

Abstract

The (distance) Laplacian spectrum is said to determine a graph Γ if there is no non-isomorphic graph whose (distance) Laplacian spectra is same as that of Γ. Aouchiche et al. [3] proved that “complete k-partite graph is determined by its distance Laplacian spectrum”. This result is not true. In this paper, we determine the correct result on this. Further motivated by this, the distance Laplacian spectral determination of complete k-partite graph with edge addition is studied and at last it is shown that the graphs whose complements are disconnected and determined by their Laplacian spectra are also determined by their distance Laplacian spectra.

Suggested Citation

  • Rakshith, B.R. & Das, Kinkar Chandra, 2023. "On distance Laplacian spectral determination of complete multipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 443(C).
  • Handle: RePEc:eee:apmaco:v:443:y:2023:i:c:s0096300322008554
    DOI: 10.1016/j.amc.2022.127787
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322008554
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2022.127787?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xue, Jie & Liu, Shuting & Shu, Jinlong, 2018. "The complements of path and cycle are determined by their distance (signless) Laplacian spectra," Applied Mathematics and Computation, Elsevier, vol. 328(C), pages 137-143.
    2. Aouchiche, Mustapha & Hansen, Pierre, 2018. "Cospectrality of graphs with respect to distance matrices," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 309-321.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Abdollah Alhevaz & Maryam Baghipur & Hilal A. Ganie & Yilun Shang, 2019. "On the Generalized Distance Energy of Graphs," Mathematics, MDPI, vol. 8(1), pages 1-16, December.
    2. Abiad, Aida & Alfaro, Carlos A., 2021. "Enumeration of cospectral and coinvariant graphs," Applied Mathematics and Computation, Elsevier, vol. 408(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:443:y:2023:i:c:s0096300322008554. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.