THE NIRMALA’S MINIMUM DOMINATING ENERGY OF A GRAPH

Nirmala index is one of the recently discovered topological index. It is originally a vertex based topological invariant and is defined as the sum of terms on all edges of the graph, where is the degree of the vertex in . In this paper we put forward a new energy called as the nirmala minimum dominating energy of a graph . Also, we compute for cocktail party graph, star graph, complete bipartite graph and complete graph. The estimation of upper and lower bounds for are found.