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

On the Signless Laplacian ABC -Spectral Properties of a Graph

Author

Listed:
  • Bilal A. Rather

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

  • 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

In the paper, we introduce the signless Laplacian A B C -matrix Q ̃ ( G ) = D ¯ ( G ) + A ̃ ( G ) , where D ¯ ( G ) is the diagonal matrix of A B C -degrees and A ̃ ( G ) is the A B C -matrix of G . The eigenvalues of the matrix Q ̃ ( G ) are the signless Laplacian A B C -eigenvalues of G . We give some basic properties of the matrix Q ̃ ( G ) , which includes relating independence number and clique number with signless Laplacian A B C -eigenvalues. For bipartite graphs, we show that the signless Laplacian A B C -spectrum and the Laplacian A B C -spectrum are the same. We characterize the graphs with exactly two distinct signless Laplacian A B C -eigenvalues. Also, we consider the problem of the characterization of the graphs with exactly three distinct signless Laplacian A B C -eigenvalues and solve it for bipartite graphs and, in some cases, for non-bipartite graphs. We also introduce the concept of the trace norm of the matrix Q ̃ ( G ) − t r ( Q ̃ ( G ) ) n I , called the signless Laplacian A B C -energy of G . We obtain some upper and lower bounds for signless Laplacian A B C -energy and characterize the extremal graphs attaining it. Further, for graphs of order at most 6, we compare the signless Laplacian energy and the A B C -energy with the signless Laplacian A B C -energy and found that the latter behaves well, as there is a single pair of graphs with the same signless Laplacian A B C -energy unlike the 26 pairs of graphs with same signless Laplacian energy and eight pairs of graphs with the same A B C -energy.

Suggested Citation

  • Bilal A. Rather & Hilal A. Ganie & Yilun Shang, 2024. "On the Signless Laplacian ABC -Spectral Properties of a Graph," Mathematics, MDPI, vol. 12(15), pages 1-23, July.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:15:p:2366-:d:1445592
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Yilun Shang, 2017. "Finite-time scaled consensus through parametric linear iterations," International Journal of Systems Science, Taylor & Francis Journals, vol. 48(10), pages 2033-2040, July.
    2. 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.
    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. Yilun Shang, 2018. "Resilient Multiscale Coordination Control against Adversarial Nodes," Energies, MDPI, vol. 11(7), pages 1-17, July.
    2. Zhuo-Heng He & Jie Tian & Shao-Wen Yu, 2024. "A System of Four Generalized Sylvester Matrix Equations over the Quaternion Algebra," Mathematics, MDPI, vol. 12(15), pages 1-26, July.
    3. Bin Yang & Xin Wang & Jian-an Fang & Yuhua Xu, 2019. "The Impact of Coupling Function on Finite-Time Synchronization Dynamics of Multi-Weighted Complex Networks with Switching Topology," Complexity, Hindawi, vol. 2019, pages 1-15, March.

    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:15:p:2366-:d:1445592. 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.