On k-total dominating graphs

被引：0
|
作者：
Alikhani, S. [1 ]
Fatehi, D. [1 ]
Mynhardt, C.M. [2 ]
机构：
[1] Department of Mathematics, Yazd University, Yazd,89195-741, Iran
[2] Department of Mathematics and Statistics, University of Victoria, Victoria,BC, Canada
来源：
arXiv | 2017年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graphic methods
引用
收藏
相关论文
共 50 条
  • [21] Convexity of minimal total dominating functions in graphs
    Yu, B
    COMPUTING AND COMBINATORICS, 1995, 959 : 357 - 365
  • [22] A characterization of graphs with disjoint total dominating sets
    Henning, Michael A.
    Peterin, Iztok
    ARS MATHEMATICA CONTEMPORANEA, 2019, 16 (02) : 359 - 375
  • [23] CONNECTED TOTAL DOMINATING NEIGHBORHOOD POLYNOMIAL OF GRAPHS
    Artes Jr, Rosalio G.
    Jiripa, Rashidin H. Moh.
    Salim, Jeffrey Imer C.
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2023, 39 (02): : 145 - 154
  • [24] Convexity of minimal total dominating functions in graphs
    Yu, B
    JOURNAL OF GRAPH THEORY, 1997, 24 (04) : 313 - 321
  • [25] On a generalization of signed total dominating functions of graphs
    Xing, HM
    Sun, L
    Chen, XG
    ARS COMBINATORIA, 2005, 77 : 205 - 215
  • [26] UNIVERSAL MINIMAL TOTAL DOMINATING FUNCTIONS IN GRAPHS
    COCKAYNE, EJ
    MYNHARDT, CM
    YU, B
    NETWORKS, 1994, 24 (02) : 83 - 90
  • [27] Total Dominating Sets in Maximal Outerplanar Graphs
    Magdalena Lemańska
    Rita Zuazua
    Paweł Żyliński
    Graphs and Combinatorics, 2017, 33 : 991 - 998
  • [28] Grundy Total Hop Dominating Sequences in Graphs
    Hassan, Javier A.
    Canoy Jr, Sergio R.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, 16 (04): : 2597 - 2612
  • [29] Total Roman {2}-Dominating Functions in Graphs
    Ahangar, H. Abdollahzadeh
    Chellali, M.
    Sheikholeslami, S. M.
    Valenzuela-Tripodoro, J. C.
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2022, 42 (03) : 937 - 958
  • [30] Total Dominating Sets in Maximal Outerplanar Graphs
    Lemanska, Magdalena
    Zuazua, Rita
    Zylinski, Pawel
    GRAPHS AND COMBINATORICS, 2017, 33 (04) : 991 - 998
12345