A note on the first Zagreb index and coindex of graphs

Document Type: Original paper


1 Faculty of Electronic Engineering, Nis, Serbia

2 Faculty of Electronic Engineering

3 Azarbaijan Shahid Madani University


Let $G=(V,E)$, $V={v_1,v_2,ldots,v_n}$, be a simple graph with
$n$ vertices, $m$ edges and a sequence of vertex degrees
$Delta=d_1ge d_2ge cdots ge d_n=delta$, $d_i=d(v_i)$. If
vertices $v_i$ and $v_j$ are adjacent in $G$, it is denoted as $isim j$, otherwise, we write $insim j$. The first Zagreb index is
vertex-degree-based graph invariant defined as
$M_1(G)=sum_{i=1}^nd_i^2$, whereas the first Zagreb coindex is
defined as $overline{M}_1(G)=sum_{insim j}(d_i+d_j)$. A couple of new upper and lower bounds for $M_1(G)$, as well as a new upper bound
for $overline{M}_1(G)$, are obtained.


Main Subjects