Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs

被引：0

作者：

Liu, Zi-Long ^{[1
]}

Tian, Fang ^{[2
]}

Xu, Jun-Ming ^{[3
]}

机构：

[1] Shanghai Univ Sci & Technol, Sch Elect & Comp Engn, Shanghai 200093, Peoples R China

[2] Shanghai Univ Finance & Econ, Dept Appl Math, Shanghai 200433, Peoples R China

[3] Univ Sci & Technol China, Dept Math, Hefei 230026, Peoples R China

来源：

THEORETICAL COMPUTER SCIENCE | 2009年 / 410卷 / 38-40期

关键词：

Connected dominating set; Wireless networks; Fault tolerance; Chernoff inequality; WIRELESS AD HOC; NUMBERS; ALGORITHMS; NETWORKS;

D O I：

10.1016/j.tcs.2009.05.028

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A small virtual backbone which is modeled as the minimum connected dominating set (CDS) problem has been proposed to alleviate the broadcasting storm for efficiency in wireless ad hoc networks. In this paper, we consider a general fault tolerant CDS problem, called an h-connected distance k-dominating set (HCKDS) to balance high efficiency and fault tolerance, and study the upper bound for HCKDS with a probabilistic method for small h and improve the current best results. (C) 2009 Elsevier B.V. All rights reserved.

引用

下载

页码：3804 / 3813

页数：10

共 48 条

[1] Connected k-dominating graphs
Mynhardt, C. M.
Teshima, L. E.
Roux, A.
DISCRETE MATHEMATICS, 2019, 342 (01) : 145 - 151
[2] 2-connected graphs with small 2-connected dominating sets
Caro, Y
Yuster, R
DISCRETE MATHEMATICS, 2003, 269 (1-3) : 265 - 271
[3] Constructing 2-connected k-dominating sets for fault-tolerant backbone in wireless sensor networks
Zheng, C. (zheng.chan@163.com), 1600, Northeast University (28):
[4] 2-Edge connected dominating sets and 2-Connected dominating sets of a graph
Li, Hengzhe
Yang, Yuxing
Wu, Baoyindureng
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 713 - 724
[5] 2-Edge connected dominating sets and 2-Connected dominating sets of a graph
Hengzhe Li
Yuxing Yang
Baoyindureng Wu
Journal of Combinatorial Optimization, 2016, 31 : 713 - 724
[6] Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Yeh, HG
Chang, GJ
THEORETICAL COMPUTER SCIENCE, 2001, 263 (1-2) : 3 - 8
[7] Note on dominating cycles in 2-connected graphs
Discrete Math, 1-3 (13):
[8] A note on dominating cycles in 2-connected graphs
Bauer, D
Schmeichel, E
Veldman, HJ
DISCRETE MATHEMATICS, 1996, 155 (1-3) : 13 - 18
[9] LONG DOMINATING CYCLES IN A KIND OF 2-CONNECTED GRAPHS
SHEN Ruqun (Institute of Biophysics
Journal of Systems Science & Complexity, 1995, (01) : 66 - 74
[10] On the number of independent and k-dominating sets in graphs with average vertex degree at most k
Taletskii, D. S.
SBORNIK MATHEMATICS, 2023, 214 (11) : 1627 - 1650

← 1 2 3 4 5 →