Abstract
In our research, we are studying the relationship between the energy and Zagreb indices of a graph. We have proven several results, including: (i) tight lower and upper bounds for the energy of graphs based on their order, size, minimum degree, maximum degree, minimum eigenvalue, Zagreb indices, positive inertia, and negative inertia. We have also characterized the graphs that achieve equalities. (ii) Tight lower and upper bounds for maximum eigenvalue of graphs in terms of their order, size, minimum degree, maximum degree, and Zagreb indices. We have also characterized the graphs that achieve equalities. After conducting observations and computational calculations, we have formulated the conjecture that for a non-singular graph Ω with order p, size m, and the first Zagreb index M1(Ω), the following should hold: E(Ω)≥M1(Ω)m and E(Ω)≥M1(Ω)2m+2mp, with both equalities holding iff Ω≅Kp. It has been demonstrated that proving the first inequality will validate the second inequality.
| Original language | English |
|---|---|
| Pages (from-to) | 3555-3575 |
| Number of pages | 21 |
| Journal | Journal of Applied Mathematics and Computing |
| Volume | 71 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 2025 |
Keywords
- Adjacency matrix
- Degree
- Energy
- First Zagreb index
Fingerprint
Dive into the research topics of 'On the connection between energy and Zagreb indices of graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver