Abstract
For a positive integer k, a total {k}-dominating function of a graph G is a function f from the vertex set V(G) to the set {0,1,2,…,k} such that for any vertex v∈V(G), the condition ∑ u∈N(v) f(u)≥k is fulfilled, where N(v) is the open neighborhood of v. A set {f 1,f 2,…,f d } of total {k}-dominating functions on G with the property that \(\sum_{i=1}^{d}f_{i}(v)\le k\) for each v∈V(G), is called a total {k}-dominating family (of functions) on G. The maximum number of functions in a total {k}-dominating family on G is the total {k}-domatic number of G, denoted by \(d_{t}^{\{k\}}(G)\). Note that \(d_{t}^{\{1\}}(G)\) is the classic total domatic number d t (G). In this paper we initiate the study of the total {k}-domatic number in graphs and we present some bounds for \(d_{t}^{\{k\}}(G)\). Many of the known bounds of d t (G) are immediate consequences of our results.
Similar content being viewed by others
References
Baogen X, Cockayne EJ, Haynes TW, Hedetniemi ST, Zhou S (2000) Extremal graphs for inequalities involving domination parameters. Discrete Math 216:1–10
Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10:211–219
Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Dekker, New York
Li N, Hou X (2009) On the total {k}-domination number of Cartesian products of graphs. J Comb Optim 18:173–178
West DB (2000) Introduction to graph theory. Prentice-Hall, Englewood Cliffs
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sheikholeslami, S.M., Volkmann, L. The total {k}-domatic number of a graph. J Comb Optim 23, 252–260 (2012). https://doi.org/10.1007/s10878-010-9352-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-010-9352-4