A subset D of ()V G is called an equitable dominating set if for every ()v V G D , there exists a vertex u D such that ()uv E G and | ( ) ( ) | 1deg u deg v . A subset D of ()V G is called an equitable independent set if for any u D , ()ev N u for all {}v D u where, ( ) { ( ) / (),eN u v V G v N u | ( ) ( ) | 1}deg u deg v . An equitable dominating set D is said to be an equi independent equitable dominating set if it is also an equitable independent set. The minimum cardinality of an equi independent equitable dominating set is called equi independent equitable domination number which is denoted by ei. We investigated an equi independent equitable domination number for some special graphs
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if ...
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is a...
Copyright c © 2013 Dhananjaya Murthy B. V et al. This is an open access article dis-tributed under t...
Let G = (V,E) be a graph. A subset D of V is called an equitable dominating set of a graph G if for ...
A subset D ⊆ V(G) is called an equitable dominating set of a graph G if every vertex v ∈ V(G) \ D ha...
Abstract: Let G = (V,E) be a graph, D ⊆ V and u be any vertex in D. Then the out degree of u with re...
Let G = (V,E) be a connected graph, An equitable dominating S of a graph G is called the neighborhoo...
The study of domination in graphs is one of the fastest growing areas within graph theory. An excell...
A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex ...
A set S V is a dominating set of a graph G = (V;E) if each vertex in V is either in S or is adjacen...
Let G= (V, E) be a graph and A(G) is the collection of all minimal equitable dominating set of G. Th...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
Let G = (V,E) be a graph. A subset S of V is called a Smarandachely antidegree equitable k-set for a...
In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if ...
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is a...
Copyright c © 2013 Dhananjaya Murthy B. V et al. This is an open access article dis-tributed under t...
Let G = (V,E) be a graph. A subset D of V is called an equitable dominating set of a graph G if for ...
A subset D ⊆ V(G) is called an equitable dominating set of a graph G if every vertex v ∈ V(G) \ D ha...
Abstract: Let G = (V,E) be a graph, D ⊆ V and u be any vertex in D. Then the out degree of u with re...
Let G = (V,E) be a connected graph, An equitable dominating S of a graph G is called the neighborhoo...
The study of domination in graphs is one of the fastest growing areas within graph theory. An excell...
A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex ...
A set S V is a dominating set of a graph G = (V;E) if each vertex in V is either in S or is adjacen...
Let G= (V, E) be a graph and A(G) is the collection of all minimal equitable dominating set of G. Th...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
Let G = (V,E) be a graph. A subset S of V is called a Smarandachely antidegree equitable k-set for a...
In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if ...
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is a...