249 search results - page 1 / 50 » The upper bound on k-tuple domination numbers of graphs |
DM
2008
13 years 4 months ago
2008
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 ...
EJC
2008
13 years 4 months ago
2008
COMBINATORICS
2007
13 years 4 months ago
2007
WG
2010
Springer
13 years 2 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
DM
1998
13 years 4 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...