Let  be a simple, finite and undirected connected graph. A set  is said to be a dominating set in a graph G if every vertex in  is adjacent to some vertex in S and the domination number of G is defined to be the minimum cardinality of a dominating set in G. A dominating set D is said to be an eccentric dominating set if for every  there exists at least one eccentric vertex of v in D. In this paper, we study the eccentricity properties of complementary prisms and eccentric domination in complementary prisms.

eccentricity, eccentric domination, complementary prisms