Classification of Efficient Dominating Sets of Circulant Graphs of Degree 5

被引：3
|
作者：
Kwon, Young Soo [1 ]
Lee, Jaeun [1 ]
Sohn, Moo Young [2 ]
机构：
[1] Yeungnam Univ, Math, Kyongsan 712749, South Korea
[2] Changwon Natl Univ, Math, Chang Won 641773, South Korea
来源：
GRAPHS AND COMBINATORICS | 2022年 / 38卷 / 04期
基金：
新加坡国家研究基金会;
关键词：
Efficient dominating sets; Circulant graphs; PERFECT CODES;
D O I：
10.1007/s00373-022-02527-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For a graph G, a subset D of V(G) is called an efficient dominating set of G if D is an independent set and every vertex in V(G) \ D is adjacent to exactly one vertex in the set D. In this paper, we give necessary and sufficient conditions for the existence of efficient dominating sets of circulant graphs of degree 5 and classify these sets.
引用
收藏
页数：8
相关论文
共 50 条
  • [1] Classification of Efficient Dominating Sets of Circulant Graphs of Degree 5
    Young Soo Kwon
    Jaeun Lee
    Moo Young Sohn
    Graphs and Combinatorics, 2022, 38
  • [2] Efficient dominating sets in circulant graphs
    Deng, Yun-Ping
    Sun, Yu-Qin
    Liu, Qiong
    Wang, Hai-Chao
    DISCRETE MATHEMATICS, 2017, 340 (07) : 1503 - 1507
  • [3] Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5
    Kwon, Young Soo
    Sohn, Moo Young
    SYMMETRY-BASEL, 2020, 12 (12): : 1 - 10
  • [4] Existence of efficient total dominating sets of circulant graphs of degree 4
    Kwon, Young Soo
    Sohn, Moo Young
    Chen, Xue-gang
    DISCRETE MATHEMATICS, 2020, 343 (03)
  • [5] Efficient dominating sets in circulant graphs with domination number prime
    Deng, Yun-Ping
    INFORMATION PROCESSING LETTERS, 2014, 114 (12) : 700 - 702
  • [6] Constructing Dominating Sets in Circulant Graphs
    Igor E. Shparlinski
    Annals of Combinatorics, 2018, 22 : 201 - 211
  • [7] Constructing Dominating Sets in Circulant Graphs
    Shparlinski, Igor E.
    ANNALS OF COMBINATORICS, 2018, 22 (01) : 201 - 211
  • [8] Open Locating-Dominating Sets in Circulant Graphs
    Givens, Robin
    Yu, Gexin
    Kincaid, Rex
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2022, 42 (01) : 47 - 62
  • [9] Regular sets in circulant graphs with degree 3
    Hao, Yu-Xia
    Wang, Xiaomeng
    DISCRETE APPLIED MATHEMATICS, 2024, 357 : 51 - 55
  • [10] Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
    Brandstaedt, Andreas
    Leitert, Arne
    Rautenbach, Dieter
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 267 - 277
12345