MINIMUM DOMINATING DISTANCE ENERGY OF A GRAPH

Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we introduced the concept of minimum dominating distance energyEDd(G) of a graph G and computed minimum dominating distance energies of a Stargraph,Complete graph,Crown graph and Cocktail graphs. Upper and lower boundsfor EDd(G) are also established. DOI : http://dx.doi.org/10.22342/jims.20.1.133.19-2