Abstract
Let G=(V,E) be a graph, a set S⊆V is a total k-dominating set if every vertex v∈V has at least k neighbors in S. The total k-domination number γkt(G) is the minimum cardinality among all total k-dominating sets. In this paper, we obtain several tight bounds for the total k-domination number of the strong product of two graphs. In particular, we investigate the relationship between the total k-domination number of the strong product of two graphs with the domination, k-domination and total k-domination numbers of the factors in the product.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have