31 search results - page 1 / 7 » Pairs of Disjoint Dominating Sets and the Minimum Degree of ... |
GC
2010
Springer
13 years 9 months ago
2010
Springer
SIAMCOMP
2002
13 years 10 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
APPML
2008
13 years 11 months ago
2008
Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the min...
DAM
2011
13 years 5 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
WDAG
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...