Author(s): Kexiang Xu | Kinkar Ch. Das | Kechao Tang
Journal: Opuscula Mathematica
ISSN 1232-9274
Volume: 33;
Issue: 1;
Start page: 191;
Date: 2013;
VIEW PDF
DOWNLOAD PDF 
Original page
Keywords: vertex degree | tree | upper or lower bound
ABSTRACT
For a (molecular) graph \(G\) with vertex set \(V(G)\) and edge set \(E(G)\), the first and second Zagreb indices of \(G\) are defined as \(M_1(G) = \sum_{v \in V(G)} d_G(v)^2\) and \(M_2(G) = \sum_{uv \in E(G)} d_G(u)d_G(v)\), respectively, where \(d_G(v)\) is the degree of vertex \(v\) in \(G\). The alternative expression of \(M_1(G)\) is \(\sum_{uv \in E(G)}(d_G(u) + d_G(v))\). Recently Ashrafi, Došlić and Hamzeh introduced two related graphical invariants \(\overline{M_1}(G) = \sum_{uv \notin E(G)}(d_G(u)+d_G(v))\) and \(\overline{M_2}(G) = \sum_{uv \notin E(G)} d_G(u)d_G(v)\) named as first Zagreb coindex and second Zagreb coindex, respectively. Here we define two new graphical invariants \(\overline{\Pi_1}(G) = \Pi_{uv \notin E(G)}(d_G(u)+d_G(v))\) and \(\overline{\Pi_2}(G) = \sum_{uv \notin E(G)} d_G(u)d_G(v)\) as the respective multiplicative versions of \(\overline{M_i}\) for \(i = 1, 2\). In this paper, we have reported some properties, especially upper and lower bounds, for these two graph invariants of connected (molecular) graphs. Moreover, some corresponding extremal graphs have been characterized with respect to these two indices.
Journal: Opuscula Mathematica
ISSN 1232-9274
Volume: 33;
Issue: 1;
Start page: 191;
Date: 2013;
VIEW PDF
DOWNLOAD PDF Original pageKeywords: vertex degree | tree | upper or lower bound
ABSTRACT
For a (molecular) graph \(G\) with vertex set \(V(G)\) and edge set \(E(G)\), the first and second Zagreb indices of \(G\) are defined as \(M_1(G) = \sum_{v \in V(G)} d_G(v)^2\) and \(M_2(G) = \sum_{uv \in E(G)} d_G(u)d_G(v)\), respectively, where \(d_G(v)\) is the degree of vertex \(v\) in \(G\). The alternative expression of \(M_1(G)\) is \(\sum_{uv \in E(G)}(d_G(u) + d_G(v))\). Recently Ashrafi, Došlić and Hamzeh introduced two related graphical invariants \(\overline{M_1}(G) = \sum_{uv \notin E(G)}(d_G(u)+d_G(v))\) and \(\overline{M_2}(G) = \sum_{uv \notin E(G)} d_G(u)d_G(v)\) named as first Zagreb coindex and second Zagreb coindex, respectively. Here we define two new graphical invariants \(\overline{\Pi_1}(G) = \Pi_{uv \notin E(G)}(d_G(u)+d_G(v))\) and \(\overline{\Pi_2}(G) = \sum_{uv \notin E(G)} d_G(u)d_G(v)\) as the respective multiplicative versions of \(\overline{M_i}\) for \(i = 1, 2\). In this paper, we have reported some properties, especially upper and lower bounds, for these two graph invariants of connected (molecular) graphs. Moreover, some corresponding extremal graphs have been characterized with respect to these two indices.
