Full domination in graphs
Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang (2001)
Discussiones Mathematicae Graph Theory
Similarity:
For each vertex v in a graph G, let there be associated a subgraph of G. The vertex v is said to dominate as well as dominate each vertex and edge of . A set S of vertices of G is called a full dominating set if every vertex of G is dominated by some vertex of S, as is every edge of G. The minimum cardinality of a full dominating set of G is its full domination number . A full dominating set of G of cardinality is called a -set of G. We study three types of full domination in...