On α-total domination in graphs
Discrete Applied Mathematics
Randomized algorithms and upper bounds for multiple domination in graphs and networks
Discrete Applied Mathematics
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics
Hi-index | 0.00 |
We provide a new upper bound for the α-domination number in terms of a parameter α, 0 k-tuple domination.