IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i5p512-d508748.html
   My bibliography  Save this article

On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

Author

Listed:
  • Maryam Baghipur

    (Department of Mathematics, Faculty of Science, Shahid Rajaee, Teacher Training University, Tehran 16785-136, Iran)

  • Modjtaba Ghorbani

    (Department of Mathematics, Faculty of Science, Shahid Rajaee, Teacher Training University, Tehran 16785-136, Iran)

  • Hilal A. Ganie

    (Department of School Education, Jammu and Kashmir Government, Kashmir 193404, India)

  • Yilun Shang

    (Department of Computer and Information Sciences, Northumbria University, Newcastle NE1 8ST, UK)

Abstract

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as R Q ( G ) = diag ( R H ( G ) ) + R D ( G ) . Here, R D ( G ) is the Harary matrix (also called reciprocal distance matrix) while diag ( R H ( G ) ) represents the diagonal matrix of the total reciprocal distance vertices. In the present work, some upper and lower bounds for the second-largest eigenvalue of the signless Laplacian reciprocal distance matrix of graphs in terms of various graph parameters are investigated. Besides, all graphs attaining these new bounds are characterized. Additionally, it is inferred that among all connected graphs with n vertices, the complete graph K n and the graph K n − e obtained from K n by deleting an edge e have the maximum second-largest signless Laplacian reciprocal distance eigenvalue.

Suggested Citation

  • Maryam Baghipur & Modjtaba Ghorbani & Hilal A. Ganie & Yilun Shang, 2021. "On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue," Mathematics, MDPI, vol. 9(5), pages 1-12, March.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:5:p:512-:d:508748
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/5/512/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/5/512/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Abdollah Alhevaz & Maryam Baghipur & Yilun Shang, 2019. "Merging the Spectral Theories of Distance Estrada and Distance Signless Laplacian Estrada Indices of Graphs," Mathematics, MDPI, vol. 7(10), pages 1-24, October.
    2. Yilun Shang, 2020. "Estrada Index and Laplacian Estrada Index of Random Interdependent Graphs," Mathematics, MDPI, vol. 8(7), pages 1-8, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Maryam Baghipur & Modjtaba Ghorbani & Shariefuddin Pirzada & Najaf Amraei, 2023. "On the Generalized Adjacency Spread of a Graph," Mathematics, MDPI, vol. 11(6), pages 1-9, March.
    2. Rather, Bilal A. & Ganie, Hilal A. & Shang, Yilun, 2023. "Distance Laplacian spectral ordering of sun type graphs," Applied Mathematics and Computation, Elsevier, vol. 445(C).

    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.

    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:gam:jmathe:v:9:y:2021:i:5:p:512-:d:508748. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.