ویراساینس.
سند علمی

On the algorithmic complexity of k-tuple total domination

James K. Lan, Gerard J. Chang

چکیده

For a fixed positive integer k, a k-tuple total dominating set of a graph G is a subset D ⊆ V (G) such that every vertex of G is adjacent to at least k vertices in D. The k-tuple total domination problem is to determine a minimum k-tuple total dominating set of G. This paper studies k-tuple total domination from an algorithmic point of view. In particular, we present a linear-time algorithm for the k-tuple total domination problem for graphs in which each block is a clique, a cycle or a complete bipartite graph, which include trees, block graphs, cacti and block-cactus graphs. We also establish NP-completeness of the k-tuple total domination problem in undirected path graphs.

اسناد مشابه

  • Algorithmic aspects of k-tuple total domination in graphs

    سند علمی۲۰۱۲Inf. Process. Lett.Dinabandhu Pradhan

    a r t i c l e i n f o a b s t r a c t For a fixed positive integer k, a k-tuple total dominating set of a graph G = (V , E) is a subset T D k of V such that every vertex in V is adjacent to at least k vertices of T D k. In minimum k-tuple total dominating set problem (Min k-Tuple

  • k-tuple total domination and mycieleskian graphs

    مقاله۲۰۱۱transactions on combinatoricsadel p. kazemi

    let $k$ be a positive integer. a subset $s$ of $v(g)$ in a graph $g$ is a $k$-tuple total dominating set of $g$ if every vertex of $g$ has at least $k$ neighbors in $s$. the $k$-tuple total domination number $gamma _{times k,t}(g)$ of $g$ is the minimum cardinality of a $k$-tuple

  • k-TUPLE TOTAL DOMINATION IN INFLATED GRAPHS

    سند علمی۲۰۱۱ADEL P. KAZEMI

    The inflated graph GI of a graph G with n(G) vertices is obtained from G by replacing every vertex of degree d of G by a clique, which is isomorph to the complete graph Kd, and each edge (xi, xj) of G is replaced by an edge (u, v) in such a way that u ∈ Xi, v ∈ Xj , and two diffe

  • 2-Tuple Total Domination Number in Circulant Graphs

    سند علمی۲۰۱۵A. Shobana

    In this paper, a necessary and sufficient condition for the existence of an efficient 2-dominating set in a class of circulant graphs has been obtained and for those circulant graphs, an upper bound for the 2domination number is also obtained. For the circulant graphs Cir(n,A), w

  • k-TUPLE TOTAL DOMINATION AND MYCIELESKIAN GRAPHS

    سند علمی۲۰۱۲A. P. KAZEMI, Mehdi Alaeiyan, A. P. Kazemi

    Let k be a positive integer. A subset S of V (G) in a graph G is a k-tuple total dominating set of G if every vertex of G has at least k neighbors in S. The k-tuple total domination number γ×k,t(G) of G is the minimum cardinality of a k-tuple total dominating set of G. In this pa

  • On the algorithmic complexity ofk-tuple total domination

    مقاله‌ی دسترسی آزاد۲۰۱۴Discrete Applied MathematicsJames K.Lan, Gerard JennhwaChang