Dominating sets with at most k components

被引：0
|
作者：
Hartnell, BL [1 ]
Vestergaard, PD
机构：
[1] St Marys Univ, Dept Math & Comp Sci, Halifax, NS B3H 3C3, Canada
[2] Aalborg Univ, Dept Math, DK-9220 Aalborg, Denmark
来源：
ARS COMBINATORIA | 2005年 / 74卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A connected dominating set D of a graph G has the property that not only does D dominate the graph but the subgraph induced by the vertices of D is also connected. We generalize this concept by allowing the subgraph induced by D to contain at most k components and examine the minimum possible order of such a set. In the case of trees we provide lower and upper bounds and a characterization for those trees which achieve the former.
引用
收藏
页码：223 / 229
页数：7
相关论文
共 50 条
  • [1] 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
  • [2] Dominating sets inducing large components
    Alvarado, Jose D.
    Dantas, Simone
    Rautenbach, Dieter
    DISCRETE MATHEMATICS, 2016, 339 (11) : 2715 - 2720
  • [3] Dominating sets in k-majority tournaments
    Alon, N
    Brightwell, G
    Kierstead, HA
    Kostochka, AV
    Winkler, P
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (03) : 374 - 387
  • [4] On the Number of k-Dominating Independent Sets
    Nagy, Zoltan Lorant
    JOURNAL OF GRAPH THEORY, 2017, 84 (04) : 566 - 580
  • [5] Recurrence among trees with most numerous efficient dominating sets
    Faculty of Mathematics and Applied Physics, Technical University of Rzeszów, W. Pola 2, 35-959 Rzeszów, Poland
    不详
    Discrete Math. Theor. Comput. Sci., 2008, 1 (43-56):
  • [6] Recurrence among trees with most numerous efficient dominating sets
    Brod, Dorota
    Skupien, Zdzislaw
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2008, 10 (01): : 43 - 55
  • [7] A distributed algorithm to find k-dominating sets
    Penso, LD
    Barbosa, VC
    DISCRETE APPLIED MATHEMATICS, 2004, 141 (1-3) : 243 - 253
  • [8] Trees with extremal numbers of k-dominating sets
    Taletskii, D. S.
    DISCRETE MATHEMATICS, 2022, 345 (01)
  • [9] K-dominating sets of cardinal products of paths
    Klobucar, A
    Seifter, N
    ARS COMBINATORIA, 2000, 55 : 33 - 41
  • [10] Finding the most-vital-vertices with respect to dominating sets on graphs
    Yen, WCK
    PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 543 - 546
12345