A simple algorithm for secure domination in proper interval graphs

被引：8
|
作者：
Zou, Y. H. [1 ]
Liu, J. J. [2 ]
Hsu, C. C. [1 ]
Wang, Y. L. [1 ]
机构：
[1] Natl Taiwan Univ Sci & Technol, Dept Informat Management, Taipei, Taiwan
[2] Shih Hsin Univ, Dept Informat Management, 1 Lane 17 Sec 1,Mu Cha Rd, Taipei 10607, Taiwan
来源：
DISCRETE APPLIED MATHEMATICS | 2019年 / 260卷
关键词：
Secure domination; Domination; Proper interval graphs;
D O I：
10.1016/j.dam.2019.01.012
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In [Secure domination in proper interval graphs, Discrete Applied Mathematics 247 (2018) 70-76], Araki and Miyazaki proposed a linear-time algorithm for finding the secure domination number of proper interval graphs. However, the example they provided is exactly a counterexample. Based on their main idea, we propose a new simple algorithm for solving this problem in this paper. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码：289 / 293
页数：5
相关论文
共 50 条
  • [41] Secure domination in rooted product graphs
    Rangel Hernández-Ortiz
    Luis Pedro Montejano
    Juan Alberto Rodríguez-Velázquez
    Journal of Combinatorial Optimization, 2021, 41 : 401 - 413
  • [42] Secure w-Domination in Graphs
    Cabrera Martinez, Abel
    Estrada-Moreno, Alejandro
    Rodriguez-Velazquez, Juan A.
    SYMMETRY-BASEL, 2020, 12 (12): : 1 - 11
  • [43] Bounded Representations of Interval and Proper Interval Graphs
    Balko, Martin
    Klavik, Pavel
    Otachi, Yota
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 535 - 546
  • [44] TOTAL DOMINATION IN INTERVAL-GRAPHS
    KEIL, JM
    INFORMATION PROCESSING LETTERS, 1986, 22 (04) : 171 - 174
  • [45] A matrix characterization of interval and proper interval graphs
    Mertzios, George B.
    APPLIED MATHEMATICS LETTERS, 2008, 21 (04) : 332 - 337
  • [46] On the interval chromatic number of proper interval graphs
    Shalom, Mordechai
    DISCRETE MATHEMATICS, 2015, 338 (11) : 1907 - 1916
  • [47] Domination in bounded interval tolerance graphs
    Adhar, GS
    SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS: WORKSHOPS, PROCEEDINGS, 2000, : 29 - 34
  • [48] A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
    Panda, B. S.
    Das, Sajal K.
    INFORMATION PROCESSING LETTERS, 2009, 109 (18) : 1041 - 1046
  • [49] TOTAL DOMINATION IN INTERVAL-GRAPHS
    BERTOSSI, AA
    INFORMATION PROCESSING LETTERS, 1986, 23 (03) : 131 - 134
  • [50] Secure total domination in graphs: Bounds and complexity
    Duginov, Oleg
    DISCRETE APPLIED MATHEMATICS, 2017, 222 : 97 - 108
12345