Some remarks on lower bounds on the p-domination number in trees

被引：0
|
作者：
Volkmann, Lutz [1 ]
机构：
[1] Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany
来源：
Journal of Combinatorial Mathematics and Combinatorial Computing | 2007年 / 61卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：159 / 167
相关论文
共 50 条
  • [1] Some bounds on the p-domination number in trees
    Blidia, Mostafa
    Chellali, Mustapha
    Volkmann, Lutz
    DISCRETE MATHEMATICS, 2006, 306 (17) : 2031 - 2037
  • [2] The p-domination number of complete multipartite graphs
    Lu, You
    Xu, Jun-Ming
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (04)
  • [3] P-DOMINATION AND BOREL SETS
    Basile, Desiree
    Darji, Udayan B.
    HOUSTON JOURNAL OF MATHEMATICS, 2017, 43 (01): : 255 - 262
  • [4] New bounds on the double domination number of trees
    Cabrera-Martinez, Abel
    DISCRETE APPLIED MATHEMATICS, 2022, 315 : 97 - 103
  • [5] Connected p-domination in graphs
    Volkmann, Lutz
    UTILITAS MATHEMATICA, 2009, 79 : 81 - 90
  • [6] BOUNDS ON THE LOCATING ROMAN DOMINATION NUMBER IN TREES
    Rad, Nader Jafari
    Rahbani, Hadi
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (01) : 49 - 62
  • [7] On the p-domination, the total domination and the connected domination numbers of graphs
    Chellali, Mustapha
    Favaron, Odile
    Hansberg, Adriana
    Volkmann, Lutz
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2010, 73 : 65 - 75
  • [8] BOUNDS ON THE LOCATING-DOMINATION NUMBER AND DIFFERENTIATING-TOTAL DOMINATION NUMBER IN TREES
    Rad, Nader Jafari
    Rahbani, Hadi
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (02) : 455 - 462
  • [9] Lower bounds for the domination number and the total domination number of direct product graphs
    Mekis, Gasper
    DISCRETE MATHEMATICS, 2010, 310 (23) : 3310 - 3317
  • [10] Lower bounds on the total domination number of a graph
    Desormeaux, Wyatt J.
    Henning, Michael A.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 52 - 66
12345