Computing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers

The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition sets differ in size by at most 1. The Wiener number [1] is the first reported distance based topological index and is defined as half sum of the distances between all the pairs of vertices in a molecular graph. Recently, some new versions of Zagreb indices are considered by mathematicians. In the present study we compute some bounds of multiplicative Zagreb indices and then we study these topological indices by using concept of chromatic number and clique number.