Advances and Applications in Discrete Mathematics
Volume 9, Issue 1, Pages 45 - 55
(January 2012)
|
|
MIXED TREE DOMINATION NUMBER
Raji Pilakkat and Preethi Kuttipulackal
|
Abstract: A mixed dominating set of a connected graph is a mixed tree dominating set of G if the elements of S along with the ends of the edges in it constitute a tree. A mixed tree dominating set S is a minimal mixed tree dominating set if no proper subset of S is a mixed tree dominating set. The mixed tree domination number of G is the minimum cardinality of a mixed tree dominating set. In this paper, we include some basic results on mixed tree domination, bounds on and its exact values for some standard graphs. |
Keywords and phrases: corona, wheel graph, wounded
spider, spanning tree, dominating set, mixed dominating set, private neighbour,
mixed tree dominating set, mixed tree domination number,
-set.
|
Communicated by Garth Isaak |
Number of Downloads: 333 | Number of Views: 703 |
|