Add to ORKGA set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by γit(G). In this paper we begin an investiga-tion of this parameter
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
We initiate the study of double outer-independent domination in graphs. A vertex of a graph is said ...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
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...
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at l...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
AbstractA set D of vertices of a graph G is called a dominating set of G if every vertex in V(G)−D i...
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...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
A set S of vertices in a graph G is called an independent dominating set if S is both independent an...
A set S of vertices in a graph G without isolated vertices is a total dominating set of G if every v...
AbstractFor a simple graph G, the independent domination number i(G) is defined to be the minimum ca...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
Let G =(V,E) be a graph. A subset X of E is called an edge dominating set of G if every edge in E - ...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
We initiate the study of double outer-independent domination in graphs. A vertex of a graph is said ...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
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...
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at l...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
AbstractA set D of vertices of a graph G is called a dominating set of G if every vertex in V(G)−D i...
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...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
A set S of vertices in a graph G is called an independent dominating set if S is both independent an...
A set S of vertices in a graph G without isolated vertices is a total dominating set of G if every v...
AbstractFor a simple graph G, the independent domination number i(G) is defined to be the minimum ca...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
Let G =(V,E) be a graph. A subset X of E is called an edge dominating set of G if every edge in E - ...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
We initiate the study of double outer-independent domination in graphs. A vertex of a graph is said ...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...