DOMINATION IN PERMUTATION GRAPHS

被引：64
|
作者：
FARBER, M
KEIL, JM
机构：
[1] UNIV WATERLOO,DEPT COMBINATOR & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA
[2] UNIV SASKATCHEWAN,DEPT COMP SCI,SASKATOON S7N 0W0,SASKATCHEWAN,CANADA
来源：
JOURNAL OF ALGORITHMS | 1985年 / 6卷 / 03期
关键词：
D O I：
10.1016/0196-6774(85)90001-X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：309 / 321
页数：13
相关论文
共 50 条
  • [1] Power domination on permutation graphs
    Wilson, S.
    DISCRETE APPLIED MATHEMATICS, 2019, 262 : 169 - 178
  • [2] BOUNDS ON THE DOMINATION NUMBER OF PERMUTATION GRAPHS
    Gu, Weizhen
    Wash, Kirsti
    JOURNAL OF INTERCONNECTION NETWORKS, 2009, 10 (03) : 205 - 217
  • [3] Acyclic domination on bipartite permutation graphs
    Xu, Guangjun
    Kang, Liying
    Shan, Erfang
    INFORMATION PROCESSING LETTERS, 2006, 99 (04) : 139 - 144
  • [4] On the broadcast domination number of permutation graphs
    Yi, Eunjeong
    THEORETICAL COMPUTER SCIENCE, 2020, 806 : 171 - 183
  • [5] ON DOMINATION PROBLEMS FOR PERMUTATION AND OTHER GRAPHS
    BRANDSTADT, A
    KRATSCH, D
    THEORETICAL COMPUTER SCIENCE, 1987, 54 (2-3) : 181 - 198
  • [6] EDGE DOMINATION ON BIPARITE PERMUTATION GRAPHS AND COTRIANGULATED GRAPHS
    SRINIVASAN, A
    MADHUKAR, K
    NAGAVAMSI, P
    RANGAN, CP
    CHANG, MS
    INFORMATION PROCESSING LETTERS, 1995, 56 (03) : 165 - 171
  • [7] PERMUTATION GRAPHS - CONNECTED DOMINATION AND STEINER TREES
    COLBOURN, CJ
    STEWART, LK
    DISCRETE MATHEMATICS, 1990, 86 (1-3) : 179 - 189
  • [8] A NEW APPROACH FOR THE DOMINATION PROBLEM ON PERMUTATION GRAPHS
    LIANG, Y
    RHEE, C
    DHALL, SK
    LAKSHMIVARAHAN, S
    INFORMATION PROCESSING LETTERS, 1991, 37 (04) : 219 - 224
  • [9] CONNECTED DOMINATION AND STEINER SET ON WEIGHTED PERMUTATION GRAPHS
    ARVIND, K
    REGAN, CP
    INFORMATION PROCESSING LETTERS, 1992, 41 (04) : 215 - 220
  • [10] Vertex-Edge Domination in Interval and Bipartite Permutation Graphs
    Paul, Subhabrata
    Pradhan, Dinabandhu
    Verma, Shaily
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023, 43 (04) : 947 - 963
12345