Abstract
Incidence energy of the graph G, denoted by IE(G), is defined as the sum of the singular values of its incidence matrix. The notion of incidence energy of subgraph complements of a graph has been proposed in this study. The expression for the sum of singular values and eigenvalues of [I(G ⊕ S)] and [I(G ⊕ S)][I(G ⊕ S)]T, respectively has been obtained. Additionally, we have noted the changes in the trace of [I(G ⊕ S)][I(G ⊕ S)]T upon deleting an edge of G ⊕ S. We have characterized incidence energy of subgraph complement of Pn and K1, n−1 and also, obtained some bounds for incidence energy of subgraph complements of a graph. The incidence energy of subgraph complement of complete graph, complete bipartite graph and star has been computed.
| Original language | English |
|---|---|
| Pages (from-to) | 597-613 |
| Number of pages | 17 |
| Journal | International Journal of Applied Mathematics |
| Volume | 37 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 2024 |
All Science Journal Classification (ASJC) codes
- General Mathematics
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'INCIDENCE ENERGY OF SUBGRAPH COMPLEMENTS OF GRAPHS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver