Eulerian k-dominating reconfiguration graphs

被引:0
|
作者
Messinger, M.E. [1 ]
Porter, Amanda [1 ]
机构
[1] Mount Allison University, Sackville,NB, Canada
来源
关键词
Cardinalities - Condition - Dominating sets - Domination - Eulerian - Eulerian graphs - Graph G - K-dominating graph - Reconfiguration - Single vertex;
D O I
暂无
中图分类号
学科分类号
摘要
13
引用
收藏
相关论文
共 50 条
  • [1] Eulerian k-dominating reconfiguration graphs
    Messinger, M. E.
    Porter, Amanda
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2025, 27 (02):
  • [2] Connected k-dominating graphs
    Mynhardt, C. M.
    Teshima, L. E.
    Roux, A.
    DISCRETE MATHEMATICS, 2019, 342 (01) : 145 - 151
  • [3] The k-Dominating Graph
    Haas, R.
    Seyffarth, K.
    GRAPHS AND COMBINATORICS, 2014, 30 (03) : 609 - 617
  • [4] The k-Dominating Graph
    R. Haas
    K. Seyffarth
    Graphs and Combinatorics, 2014, 30 : 609 - 617
  • [5] 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
  • [6] Randomized greedy algorithms for finding small k-dominating sets of regular graphs
    Duckworth, W
    Mans, B
    RANDOM STRUCTURES & ALGORITHMS, 2005, 27 (03) : 401 - 412
  • [7] Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
    Czygrinow, Andrzej
    Hanckowiak, Michal
    Wawrzyniak, Wojciech
    Witkowski, Marcin
    THEORETICAL COMPUTER SCIENCE, 2020, 809 (809) : 327 - 338
  • [8] On the Number of k-Dominating Independent Sets
    Nagy, Zoltan Lorant
    JOURNAL OF GRAPH THEORY, 2017, 84 (04) : 566 - 580
  • [9] On minimum m-connected k-dominating set problem in unit disc graphs
    Weiping Shang
    Frances Yao
    Pengjun Wan
    Xiaodong Hu
    Journal of Combinatorial Optimization, 2008, 16 : 99 - 106
  • [10] Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
    Yeh, HG
    Chang, GJ
    THEORETICAL COMPUTER SCIENCE, 2001, 263 (1-2) : 3 - 8