DEGREE EQUITABLE DOMINATION ON GRAPHS

A subset D of V is called an equitable dominating set if for every upsilon is an element of V - D there exists a vertex u is an element of D such that uv is an element of(G) and vertical bar deg(u) deg(v)vertical bar <= 1, where deg(u) denotes the degree of vertex a and deg(v) denotes the degree of vertex v. The minimum cardinality of such a dominating set is denoted by gamma(e) and is called the equitable domination number of G. This Paper aims at the study of a new concept called degree equitable domination introduced by Prof. E. Sampathkumar. Minimal equitable dominating sets are characterized. The complexity of the new parameter namely equitable domination number is determined.