Algorithmic complexity of weakly connected Roman domination in graphs

被引:0
|
作者
Chakradhar, Padamutham [1 ]
Reddy, Palagiri Venkata Subba [1 ]
Himanshu, Khandelwal [1 ]
机构
[1] Natl Inst Technol, Dept Comp Sci & Engn, Warangal 506004, Telangana, India
关键词
Roman dominating function; weakly connected Roman domination; APX-complete; integer linear programming; NP-complete; LINEAR-PROGRAMMING FORMULATION; APPROXIMATION; EMPIRE;
D O I
10.1142/S1793830921501251
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For a simple, undirected, connected graph G, a function h: V(G) -> {0, 1, 2} which satisfies the following conditions is called a weakly connected Roman dominating function (WCRDF) of G with weight h(V) = Sigma(p is an element of V) h(p). (C1). For all q is an element of V with h(q) = 0 there exists a vertex r such that (q, r) is an element of E and h(r) = 2 and (C2). The graph with vertex set V(G) and edge set {(p, z) : h(p) >= 1 or h(z) >= 1 or both} is connected. The problem of determining WCRDF of minimum weight is called minimum weakly connected Roman domination problem (MWCRDP). In this paper, we show that MWCRDP is polynomial time solvable for bounded treewidth graphs, threshold graphs and chain graphs. We design a 2(1 + epsilon)(1 +In(Delta - 1))-approximation algorithm for the MWCRDP and show that the same cannot have (1 - delta) In vertical bar V vertical bar ratio approximation algorithm for any delta > 0 unless P = NP. Next, we show that MWCRDP is APX-hard for graphs with Delta = 4. We also show that the domination and weakly connected Roman domination problems are not equivalent in computational complexity aspects. Finally, two different integer linear programming formulations for MWCRDP are proposed.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] Weakly connected Roman domination in graphs
    Raczek, Joanna
    Cyman, Joanna
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 267 : 151 - 159
  • [3] Algorithmic complexity of secure connected domination in graphs
    Kumar, J. Pavan
    Reddy, P. Venkata Subba
    Arumugam, S.
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 1010 - 1013
  • [4] Algorithmic and complexity aspects of problems related to total Roman domination for graphs
    Poureidi, Abolfazl
    Rad, Nader Jafari
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (03) : 747 - 763
  • [5] Algorithmic and complexity aspects of problems related to total Roman domination for graphs
    Abolfazl Poureidi
    Nader Jafari Rad
    [J]. Journal of Combinatorial Optimization, 2020, 39 : 747 - 763
  • [6] On weakly connected domination in graphs
    Dunbar, JE
    Grossman, JW
    Hattingh, JH
    Hedetniemi, ST
    McRae, AA
    [J]. DISCRETE MATHEMATICS, 1997, 167 : 261 - 269
  • [7] Algorithmic aspects of Roman domination in graphs
    Chakradhar Padamutham
    Venkata Subba Reddy Palagiri
    [J]. Journal of Applied Mathematics and Computing, 2020, 64 : 89 - 102
  • [8] Algorithmic aspects of Roman domination in graphs
    Padamutham, Chakradhar
    Palagiri, Venkata Subba Reddy
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2020, 64 (1-2) : 89 - 102
  • [9] On algorithmic complexity of double Roman domination
    Poureidi, Abolfazl
    Rad, Nader Jafari
    [J]. DISCRETE APPLIED MATHEMATICS, 2020, 285 : 539 - 551
  • [10] On the Algorithmic Complexity of Roman {2}-Domination (Italian Domination)
    Poureidi, Abolfazl
    Rad, Nader Jafari
    [J]. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE, 2020, 44 (03): : 791 - 799