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 条

[21] A randomized algorithm for determining dominating sets in graphs of maximum degree five
Khamis, Soheir M.
Daoud, Sameh S.
Essa, Hanaa A. E.
THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5122 - 5127
[22] Dominating Sets Inducing Large Component in Graphs with Minimum Degree Two
Wei Yang
Baoyindureng Wu
Graphs and Combinatorics, 2023, 39
[23] Dominating Sets Inducing Large Component in Graphs with Minimum Degree Two
Yang, Wei
Wu, Baoyindureng
GRAPHS AND COMBINATORICS, 2023, 39 (05)
[24] Small independent edge dominating sets in graphs of maximum degree three
Zwoiniak, GY
SOFSEM 2006: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2006, 3831 : 556 - 564
[25] On dominating sets and independent sets of graphs
Harant, J
Pruchnewski, A
Voigt, M
COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 547 - 553
[26] A dichotomy for weighted efficient dominating sets with bounded degree vertices
Brandstaedt, Andreas
Milanic, Martin
INFORMATION PROCESSING LETTERS, 2019, 142 : 30 - 34
[27] Efficient Local Search for Minimum Dominating Sets in Large Graphs
Fan, Yi
Lai, Yongxuan
Li, Chengqian
Li, Nan
Ma, Zongjie
Zhou, Jun
Latecki, Longin Jan
Su, Kaile
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2019), PT II, 2019, 11447 : 211 - 228
[28] Disjoint dominating and total dominating sets in graphs
Henning, Michael A.
Loewenstein, Christian
Rautenbach, Dieter
Southey, Justin
DISCRETE APPLIED MATHEMATICS, 2010, 158 (15) : 1615 - 1623
[29] Super Dominating Sets in Graphs
M. Lemańska
V. Swaminathan
Y. B. Venkatakrishnan
R. Zuazua
Proceedings of the National Academy of Sciences, India Section A: Physical Sciences, 2015, 85 : 353 - 357
[30] EDGE DOMINATING SETS IN GRAPHS
YANNAKAKIS, M
GAVRIL, F
SIAM JOURNAL ON APPLIED MATHEMATICS, 1980, 38 (03) : 364 - 372

← 1 2 3 4 5 →