Advances and Applications in Discrete Mathematics
Volume 18, Issue 2, Pages 179 - 190
(April 2017) http://dx.doi.org/10.17654/AADMApr2017_179_190 |
|
-DOMINATION IN GRAPHS
Sergio R. Canoy, Jr. and Shaleema A. Arriola
|
Abstract: Let be a simple graph. A subset S of is a -dominating set of G if it is a dominating set of G such that for each there exists such that The smallest cardinality of a -dominating set of G, denoted by is called the -domination number of G. In this paper, we characterize the -dominating sets of the join, the corona, and the lexicographic product of graphs and determine bounds for the -domination numbers of some of these graphs. |
Keywords and phrases: domination, -domination, join, corona, lexicographic product. |
|
Number of Downloads: 336 | Number of Views: 1133 |
|