DOMINATING CLIQUES IN CHORDAL GRAPHS

被引:11
|
作者
KRATSCH, D
DAMASCHKE, P
LUBIW, A
机构
[1] FRIEDRICH SCHILLER UNIV,FAC MATH,O-6900 JENA,GERMANY
[2] UNIV WATERLOO,DEPT COMP SCI,WATERLOO N2L 3G1,ONTARIO,CANADA
关键词
D O I
10.1016/0012-365X(94)90118-X
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set-and, furthermore, there is a linear-time algorithm to find such a small dominating clique.
引用
收藏
页码:269 / 275
页数:7
相关论文
共 50 条
  • [1] FINDING DOMINATING CLIQUES EFFICIENTLY, IN STRONGLY CHORDAL GRAPHS AND UNDIRECTED PATH GRAPHS
    KRATSCH, D
    DISCRETE MATHEMATICS, 1990, 86 (1-3) : 225 - 238
  • [2] DOMINATING CLIQUES IN GRAPHS
    COZZENS, MB
    KELLEHER, LL
    DISCRETE MATHEMATICS, 1990, 86 (1-3) : 101 - 116
  • [3] DOMINATING SETS IN CHORDAL GRAPHS
    BOOTH, KS
    JOHNSON, JH
    SIAM JOURNAL ON COMPUTING, 1982, 11 (01) : 191 - 199
  • [5] On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts
    Chandran, L. Sunil
    Narayanaswamy, N. S.
    ARS COMBINATORIA, 2009, 92 : 11 - 19
  • [6] On the arrangement of cliques in chordal graphs with respect to the cuts
    Chandran, LS
    Narayanaswamy, NS
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2004, 3106 : 151 - 160
  • [7] Partitioning chordal graphs into independent sets and cliques
    Hell, P
    Klein, S
    Nogueira, LT
    Protti, F
    DISCRETE APPLIED MATHEMATICS, 2004, 141 (1-3) : 185 - 194
  • [8] Enumerating minimal dominating sets in chordal graphs
    Abu-Khzam, Faisal N.
    Heggernes, Pinar
    INFORMATION PROCESSING LETTERS, 2016, 116 (12) : 739 - 743
  • [9] Packing r-Cliques in Weighted Chordal Graphs
    P. Hell
    S. Klein
    L. T. Nogueira
    F. Protti
    Annals of Operations Research, 2005, 138 : 179 - 187
  • [10] Packing r-cliques in weighted chordal graphs
    Hell, P
    Klein, S
    Nogueira, LT
    Protti, F
    ANNALS OF OPERATIONS RESEARCH, 2005, 138 (01) : 179 - 187