The Minimum Eccentric Dominating Graph

The minimum eccentric dominating graph MmDE(G) of a graph G is defined to be the intersection graph on the minimum eccentric dominating sets of G. In this paper minimum eccentric dominating graph of some families of graphs are studied.