In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V (G) of a graph G(V, E) is called an equitable eccentric dominating set if for every v ∈ V − S there exist at least one vertex u ∈ V such that |d(v) − d(u)| ≤ 1 where vu ∈ E(G). We find equitable eccentric domination number γeqed(G) for most popular known graphs. Theorems related to γeqed(G) have been stated and proved
