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

共 49 条

[41] Constructing r-hop 2-Connected Dominating Sets for Fault-tolerant Backbone in Wireless Sensor Networks
Zheng, Chan
Yin, Ling
Zhang, Yiqing
2012 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING (WICOM), 2012,
[42] Some New Upper Bounds on the Wiener and Edge Weiner Index of k-Connected Graphs
Fath-Tabar, G. H.
ARS COMBINATORIA, 2018, 136 : 335 - 339
[43] Hamiltonicity of 2-connected {K1,4, K1,4 + e]-free graphs
Li, R
DISCRETE MATHEMATICS, 2004, 287 (1-3) : 69 - 76
[44] 2-CONNECTED k-REGULAR GRAPHS ON AT MOST 3k+3 VERTICES TO BE HAMILTONIAN (CONTINUED)
ZHU YONG-JIN LIU ZHEN-HONG (Institute of Systems Science
Academia Sinica)YU ZHENG-GUANG (Department of Applied Mathematics
Qinghua University)
系统科学与数学, 1986, (02) : 136 - 145
[45] Spanning trees with at most k leaves in 2-connected K1,r-free graphs
Chen, Guantao
Chen, Yuan
Hu, Zhiquan
Zhang, Shunzhe
APPLIED MATHEMATICS AND COMPUTATION, 2023, 445
[46] Chromatic classes of certain 2-connected (n, n+2)-graphs homeomorphic to K-4
Chen, XE
Ouyang, KZ
DISCRETE MATHEMATICS, 1997, 172 (1-3) : 17 - 29
[47] On 2-Connected Spanning Subgraphs with Bounded Degree in K1,r-Free Graphs
Roman Kužel
Jakub Teska
Graphs and Combinatorics, 2011, 27 : 199 - 206
[48] A characterization of 2-connected {K1,3, N3,1,1}-free non-Hamiltonian graphs
Chiba, Shuya
Furuya, Michitaka
DISCRETE MATHEMATICS, 2021, 344 (05)
[49] Upper bounds on the spectral radius of book-free and/or K2,l-free graphs
Shi, Lingsheng
Song, Zhipeng
LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 420 (2-3) : 526 - 529

← 1 2 3 4 5 →