An upper bound for difference of energies of a graph and its complement
The A-energy of a graph G, denoted by EA(G), is defined as sum of the absolute values of eigenvalues of adjacency matrix of G. Nikiforov in Nikiforov (2016) proved that EA(G¯)−EA(G)≤2μ¯1and EA(G)−EA(G¯)≤2μ1for any graph G and posed a problem to find best possible upper bound for EA(G)−EA(G¯), where...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2023-11-01
|
| Series: | Examples and Counterexamples |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2666657X23000022 |