^{1}
Department of Mathematics, Shahid Chamran University, Ahvaz, Iran.
^{2}
Department of Mathematics, Tehran University, Tehran, Iran.
Abstract
Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The first, second and third Zagreb indices of G are respectivly defined by: $M_1(G)=\sum_{u\in V} d(u)^2, \hspace {.1 cm} M_2(G)=\sum_{uv\in E} d(u).d(v)$ and $ M_3(G)=\sum_{uv\in E}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in G and uv is an edge of G connecting the vertices u and v. Recently, the first and second multiplicative Zagreb indices of G are defined by: $PM_1(G)=\prod_{u\in V} d(u)^2$ and $PM_2(G)=\prod_{u\in V} d(u)^{d(u)}$. The first and second Zagreb coindices of G are defined by: $ \overline {M_1}(G) =\sum_{uv\notin E} ( d(u)+d(v))$ and $ \overline {M_2}(G) =\sum_{uv\notin E} d(u).d(v)$. The indices $ \overline {PM_1}(G) =\prod_{uv\notin E} d(u)+d(v)$ and $ \overline {PM_2}(G) =\prod_{uv\notin E} d(u).d(v)$ , are called the first and second multiplicative Zagreb coindices of G, respectively. In this article, we compute the first, second and third Zagreb indices and the first and second multiplicative Zagreb indices of some classes of dendrimers. The first and second Zagreb coindices and the first and second multiplicative Zagreb coindices of these graphs are also computed.Also, the multiplicative Zagreb indices are computed using link of graphs.
Ahmadi, V., Darafsheh, M. R., & Hashemi, J. (2017). Zagreb, multiplicative Zagreb Indices and Coindices of graphs. International Journal of Industrial Mathematics, 9(1), 47-57.
MLA
V. Ahmadi; M. R. Darafsheh; J. Hashemi. "Zagreb, multiplicative Zagreb Indices and Coindices of graphs". International Journal of Industrial Mathematics, 9, 1, 2017, 47-57.
HARVARD
Ahmadi, V., Darafsheh, M. R., Hashemi, J. (2017). 'Zagreb, multiplicative Zagreb Indices and Coindices of graphs', International Journal of Industrial Mathematics, 9(1), pp. 47-57.
VANCOUVER
Ahmadi, V., Darafsheh, M. R., Hashemi, J. Zagreb, multiplicative Zagreb Indices and Coindices of graphs. International Journal of Industrial Mathematics, 2017; 9(1): 47-57.