The chapter analyzed the following questions: In this chapter, on study the properties of these sets. Actually, these efforts have been instrumental to the development of algebraic, topological, and computational techniques in graph theory. Fundamentals of Domination in Graphs. Practice online or make a printable study sheet. Therefore, any global dominating set of must contain at least four vertices including which implies that.
International Scholarly Research Notices
Volume 12, Number 1 , Therefore, any dominating set for must contain. Discrete Mathematics , , Furthermore, the vertex dominates vertices of and the remaining two vertices are pendant vertices. Concluding Remarks The concept of global domination is remarkable as it relates the dominating sets of a graph and its complement. Volume 37 Issue 4 Nov , pp. Total Domination in Graphs.
n-Domination in graphs
Graph Theory , 21 , Ranganathan, Deceased, in Duplication of an edge of a graph produces a new graph by adding an edge such that and. Let be the successive vertices of and denotes the graph obtained by switching of a vertex of. Total Domination in Graphs. Dominating sets of small cardinality are of interest.
If is a -set of then is a dominating set of. The domination in graphs is one of the concepts in graph theory which has attracted many researchers to work on it. Since every -set of contains at least two such vertices and , it is a dominating set of. Englewood Cliffs, NJ, itd: Volume 12, Number 1 , View at Google Scholar D.