Based on the lexicographic product, we find the graph in F-sum and F-product of the first and second multiplicative Zagreb index. Here, we consider the connected and simple graph. For a graph G = (V,E) with all the vertex in V(G) and edge in E(G). The number of vertices incident in a vertex u is degree of a vertex u in a graph G.
展开▼
