On the signed (total) k-domination number of a graph

被引：0
|
作者：
Liang, Hongyu [1 ]
机构：
[1] Institute for Interdisciplinary Information Sciences, Tsinghua University, China
来源：
Journal of Combinatorial Mathematics and Combinatorial Computing | 2014年 / 89卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：87 / 99
相关论文
共 50 条
  • [1] Lower bounds on the signed total k-domination number of graphs
    Volkmann, Lutz
    AEQUATIONES MATHEMATICAE, 2016, 90 (02) : 271 - 279
  • [2] Signed total k-domination in graphs
    Wang, Haichao
    Shan, Erfang
    ARS COMBINATORIA, 2013, 111 : 37 - 52
  • [3] Lower bounds on the signed total k-domination number of graphs
    Lutz Volkmann
    Aequationes mathematicae, 2016, 90 : 271 - 279
  • [4] Upper signed k-domination in a general graph
    Delic, Dejan
    Wang, Changping
    INFORMATION PROCESSING LETTERS, 2010, 110 (16) : 662 - 665
  • [5] The signed k-domination number of directed graphs
    Atapour, Maryam
    Sheikholeslami, Seyyed Mahmoud
    Hajypory, Rana
    Volkmann, Lutz
    CENTRAL EUROPEAN JOURNAL OF MATHEMATICS, 2010, 8 (06): : 1048 - 1057
  • [6] A BOUND ON THE k-DOMINATION NUMBER OF A GRAPH
    Volkmann, Lutz
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2010, 60 (01) : 77 - 83
  • [7] Upper signed k-domination number in graphs
    Zhou, Ligang
    Shan, Erfang
    Zhao, Yancai
    ARS COMBINATORIA, 2015, 122 : 307 - 318
  • [8] Signed total Italian k-domination in digraphs
    Volkmann, Lutz
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2024, 9 (02) : 339 - 351
  • [9] Signed total Italian k-domination in graphs
    Volkmann, Lutz
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2021, 6 (02) : 171 - 183
  • [10] A bound on the k-domination number of a graph
    Lutz Volkmann
    Czechoslovak Mathematical Journal, 2010, 60 : 77 - 83
12345