Chemical Graphs Constructed from Rooted Product and Their Zagreb Indices
Mahdieh Azari, Ali Iranmanesh · 2013
In this paper, we consider connected finite graphs without any loops or multiple edges. Let G be such a graph with the vertex set ) (G V and the edge set ) (G E . For ) (G V u , we denote by ) (u NG the set of all neighbors of u in G. Cardinality of the set ) (u NG is called the degree of u in G and will be denoted by ) ( deg u G . We denote by ) (u G , the sum of degrees of all neighbors of the vertex u in G, i.e., ) ( ) ( deg ) ( u N a G G G a u . We denote by |S| the cardinality of a set S.