Skip to main content
Log in

Abstract

For k≥1 an integer, a set S of vertices in a graph G with minimum degree at least k is a k-tuple total dominating set of G if every vertex of G is adjacent to at least k vertices in S. The minimum cardinality of a k-tuple total dominating set of G is the k-tuple total domination number of G. When k=1, the k-tuple total domination number is the well-studied total domination number. In this paper, we establish upper and lower bounds on the k-tuple total domination number of the cross product graph G×H for any two graphs G and H with minimum degree at least k. In particular, we determine the exact value of the k-tuple total domination number of the cross product of two complete graphs.

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

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael A. Henning.

Additional information

Research supported in part by the South African National Research Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Henning, M.A., Kazemi, A.P. k-tuple total domination in cross products of graphs. J Comb Optim 24, 339–346 (2012). https://doi.org/10.1007/s10878-011-9389-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-011-9389-z

Keywords

Navigation