Maximum graphs with a unique minimum dominating set

被引：5
|
作者：
Fischermann, M [1 ]
Rautenbach, D [1 ]
Volkmann, L [1 ]
机构：
[1] Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany
来源：
DISCRETE MATHEMATICS | 2003年 / 260卷 / 1-3期
关键词：
domination; size; unique minimum dominating set; extremal graphs;
D O I：
10.1016/S0012-365X(02)00670-2
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We present a conjecture on the maximum number of edges of a graph that has a unique minimum dominating set. We verify our conjecture for some special cases and prove a weakened version of this conjecture in general. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：197 / 203
页数：7
相关论文
共 50 条
  • [21] An improved exact algorithm for minimum dominating set in chordal graphs
    Abu-Khzam, Faisal N.
    INFORMATION PROCESSING LETTERS, 2022, 174
  • [22] A PTAS for the minimum dominating set problem in unit disk graphs
    Nieberg, T
    Hurink, J
    APPROXIMATION AND ONLINE ALGORITHMS, 2006, 3879 : 296 - 306
  • [23] Distributed minimum dominating set approximations in restricted families of graphs
    Lenzen, Christoph
    Pignolet, Yvonne-Anne
    Wattenhofer, Roger
    DISTRIBUTED COMPUTING, 2013, 26 (02) : 119 - 137
  • [24] Minimum 2-tuple dominating set of permutation graphs
    Barman S.C.
    Mondal S.
    Pal M.
    Journal of Applied Mathematics and Computing, 2013, 43 (1-2) : 133 - 150
  • [25] An iterated greedy algorithm for finding the minimum dominating set in graphs
    Casado, A.
    Bermudo, S.
    Lopez-Sanchez, A. D.
    Sanchez-Oro, J.
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2023, 207 : 41 - 58
  • [26] MINIMUM INFORMATION DOMINATING SET FOR CRITICAL SAMPLING OVER GRAPHS
    Gao, Jianhang
    Zhao, Qing
    Swami, Ananthram
    2015 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING (ICASSP), 2015, : 2954 - 2958
  • [27] Exact algorithms for finding the minimum independent dominating set in graphs
    Liu, Chunmei
    Song, Yinglei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 439 - +
  • [28] THE MINIMUM WEIGHT DOMINATING SET PROBLEM FOR PERMUTATION GRAPHS IS IN NC
    RHEE, C
    DHALL, SK
    LAKSHMIVARAHAN, S
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 28 (02) : 109 - 112
  • [29] Distributed minimum dominating set approximations in restricted families of graphs
    Christoph Lenzen
    Yvonne-Anne Pignolet
    Roger Wattenhofer
    Distributed Computing, 2013, 26 : 119 - 137
  • [30] Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
    Hong, Weizhi
    Ran, Yingli
    Zhang, Zhao
    THEORETICAL COMPUTER SCIENCE, 2022, 932 : 13 - 20
12345