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 条
  • [31] Lower bounds on the signed k-domination number of graphs
    Volkmann, Lutz
    ARS COMBINATORIA, 2017, 135 : 357 - 367
  • [32] A lower bound for the distance k-domination number of trees
    Meierling D.
    Volkmann L.
    Results in Mathematics, 2005, 47 (3-4) : 335 - 339
  • [33] SOME UPPER-BOUNDS FOR THE PRODUCT OF THE DOMINATION NUMBER AND THE CHROMATIC NUMBER OF A GRAPH
    TOPP, J
    VOLKMANN, L
    DISCRETE MATHEMATICS, 1993, 118 (1-3) : 289 - 292
  • [34] Note on power propagation time and lower bounds for the power domination number
    Ferrero, Daniela
    Hogben, Leslie
    Kenter, Franklin H. J.
    Young, Michael
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (03) : 736 - 741
  • [35] Lower bounds on the signed total k-domination number of graphs
    Lutz Volkmann
    Aequationes mathematicae, 2016, 90 : 271 - 279
  • [36] Note on power propagation time and lower bounds for the power domination number
    Daniela Ferrero
    Leslie Hogben
    Franklin H. J. Kenter
    Michael Young
    Journal of Combinatorial Optimization, 2017, 34 : 736 - 741
  • [37] Lower bounds on the signed total k-domination number of graphs
    Volkmann, Lutz
    AEQUATIONES MATHEMATICAE, 2016, 90 (02) : 271 - 279
  • [38] Application of upper and lower bounds for the domination number to Vizing's conjecture
    Clark, WE
    Ismail, MEH
    Suen, S
    ARS COMBINATORIA, 2003, 69 : 97 - 108
  • [39] Some remarks on domination
    Archdeacon, D
    Ellis-Monaghan, J
    Fisher, D
    Froncek, D
    Lam, PCB
    Seager, S
    Wei, B
    Yuster, R
    JOURNAL OF GRAPH THEORY, 2004, 46 (03) : 207 - 210
  • [40] Bounds on the strong domination number
    Rautenbach, D
    DISCRETE MATHEMATICS, 2000, 215 (1-3) : 201 - 212
12345