A set S of vertices in a graph G=(V, E) is a (2, 2)-total dominating set of G if every vertex in V is adjacent to at least 2 vertices in S and at least 2 vertices in V – S. The minimum cardinality of a (2, 2)-total dominating set is called the (2, 2)-total domination number of G and is denoted by t2,2(G). In this paper, we initiate a study of (2, 2)-total domination in graphs. Some bounds on t2,2(G) are found and its exact values for some standard graphs are obtained.
Copy the following to cite this article:
, "(2, 2) - Total Domination in Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 26, Issue 1, Page Number 15-18, 2016Copy the following to cite this URL:
, "(2, 2) - Total Domination in Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 26, Issue 1, Page Number 15-18, 2016Available from: https://www.ultrascientist.org/paper/159/