The Narumi-Katayama index of a graph G is equal to the product of degrees of all the vertices of G. In this paper, we examine the NarumiKatayama index of some derived graphs such as a Mycielski graph, subdivision graphs, double graph, extended double cover graph, thorn graph, subdivision vertex join and edge join graphs.

The Narumi-Katayama index of a graph G, denoted by NK(G), is equal to the product of the degrees of the vertices of G. In this paper we compute this index for Splice and Link of two graphs. At least with use of Link of two graphs, we compute this index for a class of dendrimers. With this method, the NK index for other class of dendrimers can be computed similarly.

The Atom-bond-connectivity index ABC of a graph G is determined by d_i and d_j. In this paper, sharp results for the general which has chemical applications are found using different methods. These new inex investigated in terms its edges, vertices degrees. particular, some relations obtained involving topological indices; Randic index, Zagreb Harmonic Narumi-Katayama index. Indeed, improved he...

Let G be a graph with vetex set V (G) and edge set E(G). The first generalized multiplicative Zagreb index of G is ∏ 1,c(G) = ∏ v∈V (G) d(v) , for a real number c > 0, and the second multiplicative Zagreb index is ∏ 2(G) = ∏ uv∈E(G) d(u)d(v), where d(u), d(v) are the degrees of the vertices of u, v. The multiplicative Zagreb indices have been the focus of considerable research in computational ...