• Publications
• Influence
Locating Total Dominating Sets in the Join, Corona and Composition of Graphs
• Mathematics
• 2014
Let G =( V (G),E(G)) be a connected graph. A subset S of V (G) is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The set NG(v) is the set of all vertices of GExpand
• 3
• PDF
Differentiating total domination in graphs: revisited
• Mathematics
• 2014
Let G = (V (G), E(G)) be a connected graph. A subset S of V (G) is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The set NG(v) is the set of all vertices of GExpand
• 1
• PDF
Differentiating Total Dominating Sets in the Join, Corona and Composition of Graphs
• Mathematics
• 2014
Let G =( V (G), E(G)) be a connected graph. A subset S of V (G )i s a total dominating set of G if every vertex of G is adjacent to some vertex in S. The set NG(v) is the set of all vertices of GExpand
• 3
• PDF
A realization problem and a characterization of locating total dominating sets in the Cartesian product of graphs
• Mathematics
• 2014
Let G = (V (G), E(G)) be a connected graph. A subset S of V (G) is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The set NG(v) is the set of all vertices of GExpand