Abstract
In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph G with minimum degree δ ≥ 2. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we give some methods to construct (edge) Zagreb equienergetic graphs and show that there are (edge) Zagreb equienergetic graphs of order n ≥9.
| Original language | English |
|---|---|
| Pages (from-to) | 155-169 |
| Number of pages | 15 |
| Journal | Communications in Combinatorics and Optimization |
| Volume | 6 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 12-2021 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Control and Optimization
Fingerprint
Dive into the research topics of 'On Zagreb energy and edge-Zagreb energy'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver