On weakly connected domination in graphs

被引：49
|
作者：
Dunbar, JE
Grossman, JW
Hattingh, JH
Hedetniemi, ST
McRae, AA
机构：
[1] CONVERSE COLL, DEPT MATH COMP SCI & PHYS, SPARTANBURG, SC USA
[2] OAKLAND UNIV, DEPT MATH SCI, ROCHESTER, MI 48309 USA
[3] CLEMSON UNIV, DEPT COMP SCI, CLEMSON, SC USA
[4] APPALACHIAN STATE UNIV, DEPT COMP SCI, BOONE, NC 28608 USA
[5] RAND AFRIKAANS UNIV, DEPT MATH, ZA-2000 JOHANNESBURG, GAUTENG, SOUTH AFRICA
来源：
DISCRETE MATHEMATICS | 1997年 / 167卷
关键词：
D O I：
10.1016/S0012-365X(96)00233-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A weakly connected dominating set for a connected graph is a dominating set D of vertices of the graph such that the edges not incident to any vertex in D do not separate the graph. This paper considers the weakly connected domination number, gamma(w), and related domination parameters. It is shown that the problem of computing gamma(w) is NP-hard in general but linear for trees. In addition, several sharp upper and lower bounds for gamma(w) are obtained.
引用
收藏
页码：261 / 269
页数：9
相关论文
共 50 条
  • [1] WEAKLY CONNECTED DOMINATION CRITICAL GRAPHS
    Lemanska, Magdalena
    Patyk, Agnieszka
    [J]. OPUSCULA MATHEMATICA, 2008, 28 (03) : 325 - 330
  • [2] Weakly connected Roman domination in graphs
    Raczek, Joanna
    Cyman, Joanna
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 267 : 151 - 159
  • [3] WEAKLY CONNECTED DOMINATION STABILITY IN GRAPHS
    Mehryar, Mohammad
    Alikhani, Saeid
    [J]. ADVANCES AND APPLICATIONS IN MATHEMATICAL SCIENCES, 2016, 16 (02): : 79 - 87
  • [4] On weakly connected domination in graphs II
    Domke, GS
    Hattingh, JH
    Markus, LR
    [J]. DISCRETE MATHEMATICS, 2005, 305 (1-3) : 112 - 122
  • [5] Generalized weakly connected domination in graphs
    Peng, Mao
    Shen, Hao
    [J]. ARS COMBINATORIA, 2008, 89 : 345 - 353
  • [6] WEAKLY CONNECTED TOTAL DOMINATION CRITICAL GRAPHS
    Sandueta, Elsie P.
    [J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2020, 25 (02): : 267 - 274
  • [7] Strong weakly connected domination subdivisible graphs
    Dettlaff, Magda
    Lemanska, Magdalena
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 47 : 269 - 277
  • [8] A note on weakly connected domination number in graphs
    Chen, Xue-gang
    Shiu, Wai Chee
    [J]. ARS COMBINATORIA, 2010, 97 : 193 - 201
  • [9] Generalized Weakly Connected Domination in Unit Disk Graphs
    Peng, Mao
    Zhang, Yuan
    [J]. PROCEEDINGS OF THE 2010 INTERNATIONAL CONFERENCE ON APPLICATION OF MATHEMATICS AND PHYSICS, VOL 2: ADVANCES ON APPLIED MATHEMATICS AND COMPUTATION MATHEMATICS, 2010, : 264 - 267
  • [10] Algorithmic complexity of weakly connected Roman domination in graphs
    Chakradhar, Padamutham
    Reddy, Palagiri Venkata Subba
    Himanshu, Khandelwal
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2022, 14 (03)
12345