Skip to main content
Log in

The {k}-domatic number of a graph

  • Published:
Aequationes mathematicae Aims and scope Submit manuscript

Abstract

For a positive integer k, a {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\in V(G)}\), the condition \({\sum_{u\in N[v]}f(u)\ge k}\) is fulfilled, where N[v] is the closed neighborhood of v. A {1}-dominating function is the same as ordinary domination. A set {f 1, f 2, . . . , f d } of {k}-dominating functions on G with the property that \({\sum_{i=1}^df_i(v)\le k}\) for each \({v\in V(G)}\), is called a {k}-dominating family (of functions) on G. The maximum number of functions in a {k}-dominating family on G is the {k}-domatic number of G, denoted by d {k}(G). Note that d {1}(G) is the classical domatic number d(G). In this paper we initiate the study of the {k}-domatic number in graphs and we present some bounds for d {k}(G). Many of the known bounds of d(G) are immediate consequences of our results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chang G.J.: The domatic number problem. Discret. Math. 125, 115–122 (1994)

    Article  MATH  Google Scholar 

  2. Cockayne E.J., Hedetniemi S.T.: Towards a theory of domination in graphs. Networks 7, 247–261 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  3. Domke, G.S., Hedetniemi, S.T., Laskar, R.C., Fricke, G.H.: Relationships between integer and fractional parameters of graphs. In: Alavi, Y., Chartrand, G., Oellermann, O.R., Schwenk, J. (eds.) Graph Theory, Combinatorics, and Applications. Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, vol. 1, pp. 371–387, (Kalamazoo, MI 1988). Wiley Publications, Hoboken (1991)

  4. Haynes T.W., Hedetniemi S.T., Slater P.J.: Fundamentals of Domination in graphs. Marcel Dekker Inc, New york (1998)

    MATH  Google Scholar 

  5. Hou X., Lu Y.: On the {k}-domination number of Cartesian products of graphs. Discret. Math. 309, 3413–3419 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. West D.B.: Introduction to Graph Theory. Prentice-Hall Inc, Englewood Cliffs (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. M. Sheikholeslami.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meierling, D., Sheikholeslami, S.M. & Volkmann, L. The {k}-domatic number of a graph. Aequat. Math. 82, 25–34 (2011). https://doi.org/10.1007/s00010-010-0062-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00010-010-0062-x

Mathematics Subject Classification (2000)

Keywords

Navigation