In this paper, we study the {k}-domination, total {k}-domin-ation, {k}-domatic number, and total {k}-domatic number problems, from complexity and ...
Abstract. In this paper, we study the {k}-domination, total {k}-domin- ation, {k}-domatic number, and total {k}-domatic number problems, from complexity and ...
In this paper, we study the {k}-domination, total {k}-domin-ation, {k}-domatic number, and total {k}-domatic number problems, from complexity and ...
People also ask
What is the time complexity of K way merge operation?
What is the K dominating set problem?
We consider two types of graph domination— { k } -domination and k-tuple domination, for a fixed positive integer k—and provide new NP-complete as well as ...
Sep 12, 2024 · The study of domination in graphs has led to a variety of dominating set problems studied in the literature. Most of these follow the following ...
In this paper, we propose two linear-time algorithms. One is for computing a weak elimination ordering of a bipartite distance-hereditary graph.
This work is focused on two variations of the classical domination problem. Let k ∈ Z+ and b v = k for each v ∈ V (G ). When A = {0, 1}, f is a k-tuple ...
Jan 26, 2024 · Several domination-like problems such as domination, total domination, and k-tuple domination are known to be NP-complete even on split graphs.
A total k-dominating set is a set of vertices such that every vertex of the graph has at least k neighbors in the set. The problems of finding the minimum size ...
We consider two variations of graph total domination, namely, k-tuple total domination and total { k } -domination (for a fixed positive integer k).