Algorithmic aspects of the k-domination problem in graphs

被引：18
|
作者：
Lan, James K. [1 ]
Chang, Gerard Jennhwa [1 ,2 ,3 ]
机构：
[1] Natl Taiwan Univ, Dept Math, Taipei 10617, Taiwan
[2] Natl Taiwan Univ, Taida Inst Math Sci, Taipei 10617, Taiwan
[3] Natl Ctr Theoret Sci, Taipei Off, Taipei, Taiwan
来源：
DISCRETE APPLIED MATHEMATICS | 2013年 / 161卷 / 10-11期
关键词：
k-domination; Tree; Block graph; Cactus; Block-cactus graph; Split graph; Algorithm; NP-complete; NUMBER;
D O I：
10.1016/j.dam.2013.01.015
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
For a positive integer k, a k-dominating set of a graph G is a subset D subset of V (G) such that every vertex not in D is adjacent to at least k vertices in D. The k-domination problem is to determine a minimum k-dominating set of G. This paper studies the k-domination problem in graphs from an algorithmic point of view. In particular, we present a linear-time algorithm for the k-domination problem for graphs in which each block is a clique, a cycle or a complete bipartite graph. This class of graphs includes trees, block graphs, cacti and block-cactus graphs. We also establish NP-completeness of the k-domination problem in split graphs. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：1513 / 1520
页数：8
相关论文
共 50 条
  • [21] New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
    Chiarelli, Nina
    Romina Hartinger, Tatiana
    Alejandra Leoni, Valeria
    Lopez Pujato, Maria Ines
    Milanic, Martin
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 128 - 141
  • [22] k-Domination and k-Independence in Graphs: A Survey
    Chellali, Mustapha
    Favaron, Odile
    Hansberg, Adriana
    Volkmann, Lutz
    GRAPHS AND COMBINATORICS, 2012, 28 (01) : 1 - 55
  • [23] Algorithmic aspects of k-tuple total domination in graphs
    Pradhan, D.
    INFORMATION PROCESSING LETTERS, 2012, 112 (21) : 816 - 822
  • [24] The signed k-domination number of directed graphs
    Atapour, Maryam
    Sheikholeslami, Seyyed Mahmoud
    Hajypory, Rana
    Volkmann, Lutz
    CENTRAL EUROPEAN JOURNAL OF MATHEMATICS, 2010, 8 (06): : 1048 - 1057
  • [25] SIGNED ROMAN EDGE k-DOMINATION IN GRAPHS
    Asgharsharghi, Leila
    Sheikholeslami, Seyed Mahmoud
    Volkmann, Lutz
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (01) : 39 - 53
  • [26] Signed double Roman k-domination in graphs
    Amjadi, J.
    Yang, Hong
    Nazari-Moghaddam, S.
    Sheikholeslami, S. M.
    Shao, Zehui
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2018, 72 : 82 - 105
  • [27] On k-domination and j-independence in graphs
    Hansberg, Adriana
    Pepper, Ryan
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (10-11) : 1472 - 1480
  • [28] BOUNDS ON PERFECT k-DOMINATION IN TREES: AN ALGORITHMIC APPROACH
    Chaluvaraju, B.
    Vidya, K. A.
    OPUSCULA MATHEMATICA, 2012, 32 (04) : 707 - 714
  • [29] k-Domination and k-Independence in Graphs: A Survey
    Mustapha Chellali
    Odile Favaron
    Adriana Hansberg
    Lutz Volkmann
    Graphs and Combinatorics, 2012, 28 : 1 - 55
  • [30] A CORRECTION TO A PAPER ON ROMAN k-DOMINATION IN GRAPHS
    Mojdeh, Doost Ali
    Moghaddam, Seyed Mehdi Hosseini
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2013, 50 (02) : 469 - 473
12345