Let D be a minimum total dominating set of G. If V−D contains a total dominating set (TDS) say S of G, then S is called a complementary total dominating set with respect to D. The complementary total domination number γ ct (G) of G is the minimum number of vertices in a complementary total dominating set (CTDS) of G .In this paper, exact values of γ ct (G) for some standard graphs are obtained. Also its relationship with other domination related parameters are investigated
In this note we give a finite forbidden subgraph characterization of the connected graphs for which ...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
Let G be a graph and Ḡ be the complement of G. The complementary prism GḠ of G is the graph formed f...
A set D of a graph G = (V,E) is a dominating set if every vertex in V −D is adjacent to some vertex ...
Let F be a minimum edge dominating set of G. If E - F contains an edge dominating set say F′, then F...
For any graph G = (V,E) a subset D ⊆ V is a dominating set if every vertex in V −D is adjacent to at...
The complementary prism of a graph G is obtained from a copy of G and its complement G̅ by adding a ...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
AbstractA subset S of V is called a total dominating set if every vertex in V is adjacent to some ve...
Copyright © 2013 G. Mahadevan et al. This is an open access article distributed under the Creative C...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A subset D of vertices of a connected graph G is called a semiglobal total dominating set if D is a...
This thesis work on the two parameters that is very important domination parameters, one parameter i...
AbstractLet G=(V,E) be a connected graph. A dominating set S of G is a weakly connected dominating s...
In this note we give a finite forbidden subgraph characterization of the connected graphs for which ...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
Let G be a graph and Ḡ be the complement of G. The complementary prism GḠ of G is the graph formed f...
A set D of a graph G = (V,E) is a dominating set if every vertex in V −D is adjacent to some vertex ...
Let F be a minimum edge dominating set of G. If E - F contains an edge dominating set say F′, then F...
For any graph G = (V,E) a subset D ⊆ V is a dominating set if every vertex in V −D is adjacent to at...
The complementary prism of a graph G is obtained from a copy of G and its complement G̅ by adding a ...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
AbstractA subset S of V is called a total dominating set if every vertex in V is adjacent to some ve...
Copyright © 2013 G. Mahadevan et al. This is an open access article distributed under the Creative C...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A subset D of vertices of a connected graph G is called a semiglobal total dominating set if D is a...
This thesis work on the two parameters that is very important domination parameters, one parameter i...
AbstractLet G=(V,E) be a connected graph. A dominating set S of G is a weakly connected dominating s...
In this note we give a finite forbidden subgraph characterization of the connected graphs for which ...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
Let G be a graph and Ḡ be the complement of G. The complementary prism GḠ of G is the graph formed f...