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

The General Extended Adjacency Eigenvalues of Chain Graphs

Author

Listed:
  • Bilal Ahmad Rather

    (Department of Mathematical Sciences, College of Science, United Arab Emirates University, Al Ain 15551, United Arab Emirates)

  • Hilal A. Ganie

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

  • Kinkar Chandra Das

    (Department of Mathematics, Sungkyunkwan University, Suwon 16419, Republic of Korea)

  • Yilun Shang

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

Abstract

In this article, we discuss the spectral properties of the general extended adjacency matrix for chain graphs. In particular, we discuss the eigenvalues of the general extended adjacency matrix of the chain graphs and obtain its general extended adjacency inertia. We obtain bounds for the largest and the smallest general extended adjacency eigenvalues and characterize the extremal graphs. We also obtain a lower bound for the spread of the general extended adjacency matrix. We characterize chain graphs with all the general extended adjacency eigenvalues being simple and chain graphs that are non-singular under the general extended adjacency matrix. Further, we determine the explicit formula for the determinant and the trace of the square of the general extended adjacency matrix of chain graphs. Finally, we discuss the energy of the general extended adjacency matrix and obtain some bounds for it. We characterize the extremal chain graphs attaining these bounds.

Suggested Citation

  • Bilal Ahmad Rather & Hilal A. Ganie & Kinkar Chandra Das & Yilun Shang, 2024. "The General Extended Adjacency Eigenvalues of Chain Graphs," Mathematics, MDPI, vol. 12(2), pages 1-16, January.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:2:p:192-:d:1314352
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/2/192/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/2/192/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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).
    2. Milovanović, Igor & Milovanović, Emina & Gutman, Ivan, 2016. "Upper bounds for some graph energies," Applied Mathematics and Computation, Elsevier, vol. 289(C), pages 435-443.
    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. Jahanbani, Akbar, 2017. "Some new lower bounds for energy of graphs," Applied Mathematics and Computation, Elsevier, vol. 296(C), pages 233-238.
    2. Das, Kinkar Ch. & Gutman, Ivan & Furtula, Boris, 2017. "On spectral radius and energy of extended adjacency matrix of graphs," Applied Mathematics and Computation, Elsevier, vol. 296(C), pages 116-123.
    3. Bravo, Diego & Cubría, Florencia & Rada, Juan, 2017. "Energy of matrices," Applied Mathematics and Computation, Elsevier, vol. 312(C), pages 149-157.
    4. Farrugia, Alexander, 2018. "The increase in the resolvent energy of a graph due to the addition of a new edge," Applied Mathematics and Computation, Elsevier, vol. 321(C), pages 25-36.

    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:12:y:2024:i:2:p:192-:d:1314352. 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.