On the connection between energy and Zagreb indices of graphs
Citations

WEB OF SCIENCE

2
Citations

SCOPUS

2

초록

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 Omega with order p, size m, and the first Zagreb index M1(Omega), the following should hold: E(Omega)>= M1(Omega)m and E(Omega)>= M1(Omega)2m+2mp, with both equalities holding iff Omega congruent to Kp. It has been demonstrated that proving the first inequality will validate the second inequality.

키워드

Adjacency matrixEnergyFirst Zagreb indexDegreeSPECTRAL-RADIUSLAPLACIAN ENERGYMAXIMAL ENERGYDIFFERENCESUMEIGENVALUESSQUARESBOUNDS
제목
On the connection between energy and Zagreb indices of graphs
저자
Das, Kinkar ChandraGhalavand, Ali
DOI
10.1007/s12190-025-02376-5
발행일
2025-06
유형
Article; Early Access
저널명
Journal of Applied Mathematics and Computing
71
페이지
3555 ~ 3575