Sciweavers

29 search results - page 1 / 6
» A generalised upper bound for the k-tuple domination number
Sort
View
DM
2008
119views more  DM 2008»
13 years 5 months 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
AOR
2006
74views more  AOR 2006»
13 years 5 months ago
Note on Upper Bounds for TSP Domination Number
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d = d(n) such that, for every instance I of the Asymmetric TSP on n cities, A pro...
Gregory Gutin, Angela Koller, Anders Yeo
COMBINATORICS
2007
84views more  COMBINATORICS 2007»
13 years 5 months ago
A New Upper Bound on the Total Domination Number of a Graph
Michael A. Henning, Anders Yeo
WG
2010
Springer
13 years 3 months ago
max-cut and Containment Relations in Graphs
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...
Marcin Kaminski