Sciweavers

DM
2008
119views more  DM 2008»
14 years 16 days ago
A generalised upper bound for the k-tuple domination number
In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...
Andrei Gagarin, Vadim E. Zverovich
APPML
2008
82views more  APPML 2008»
14 years 18 days ago
The k-tuple domination number revisited
The following fundamental result for the domination number (G) of a graph G was proved by Alon and Spencer, Arnautov, Lov
Vadim E. Zverovich