The study of domination in graphs is one of the fastest growing areas within graph theory. An excellent survey on the concept of domination and its related parameters can be found in the book by Haynes et al. [4] while some advanced topics on domination are explored in Haynes et al. [5]. The concept of domination has interesting applications in the study of social networks which motivated Prof. E. Sampathkumar to introduce the concept of equitable domination in graphs
The notion of a dominating set of a graph has been extended in a natural way to a collection of vert...
Let G= (V, E) be a graph and A(G) is the collection of all minimal equitable dominating set of G. Th...
A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex ...
In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V...
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 of ()V G is called an equitable dominating set if for every ()v V G D , there exists a...
A subset D ⊆ V(G) is called an equitable dominating set of a graph G if every vertex v ∈ V(G) \ D ha...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
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...
By a graph G = (V,E) we mean a finite, undirected graph with neither loops nor multiple edges. The o...
A set S of vertices in a graph G is called an independent dominating set if S is both independent an...
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...
A set of vertices S in a graph G is a global dominating set (GDS) of G if S is a dominating set for ...
A subset S of vertices in a graph G = (V,E) is a dominating set if every vertex in V-S is adjacent t...
The notion of a dominating set of a graph has been extended in a natural way to a collection of vert...
Let G= (V, E) be a graph and A(G) is the collection of all minimal equitable dominating set of G. Th...
A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex ...
In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V...
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 of ()V G is called an equitable dominating set if for every ()v V G D , there exists a...
A subset D ⊆ V(G) is called an equitable dominating set of a graph G if every vertex v ∈ V(G) \ D ha...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
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...
By a graph G = (V,E) we mean a finite, undirected graph with neither loops nor multiple edges. The o...
A set S of vertices in a graph G is called an independent dominating set if S is both independent an...
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...
A set of vertices S in a graph G is a global dominating set (GDS) of G if S is a dominating set for ...
A subset S of vertices in a graph G = (V,E) is a dominating set if every vertex in V-S is adjacent t...
The notion of a dominating set of a graph has been extended in a natural way to a collection of vert...
Let G= (V, E) be a graph and A(G) is the collection of all minimal equitable dominating set of G. Th...
A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex ...