Science Fair Project Encyclopedia
Domatic number
In graph theory, the domatic number of a graph G = (V, E) is the maximum integer K such that V can be partitioned into K disjoint sets V1, V2,...,VK and such that each Vi is a dominating set for G.
See also
References
- Garey, M. R. and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1979.
- Garey, M. R., D. S. Johnson and R. E. Tarjan, unpublished results.
- Cockayne, E. J., and S. T. Hedetniemi, "Optimal domination in graphs", IEEE Trans. Circuits and Systems CAS-22, 855-857.
Last updated: 05-30-2005 04:24:58
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details