Efficient dominating sets in circulant graphs
Authors:
- Yun-Ping DengYDYun-Ping Deng
- Yu-Qin SunYSYu-Qin Sun
- Qiong LiuQLQiong Liu
- Hai-Chao WangHWHai-Chao Wang
- 1 July 2017
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 340 (7) , 1503-1507
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (11401368)
- Shanghai Municipal Natural Science Foundation (14ZR1417900)
- Introduction of Shanghai University of Electric Power Scientific Research Grants (K2013-006)
This publication has 13 references indexed in Scilit:
- Perfect codes in circulant graphsDiscrete Mathematics, 2017
- Efficient dominating sets in circulant graphs with domination number primeInformation Processing Letters, 2014
- Worst-case efficient dominating sets in digraphsDiscrete Applied Mathematics, 2013
- Efficient domination in circulant graphsDiscrete Mathematics, 2013
- Efficient domination in cubic vertex-transitive graphsEuropean Journal of Combinatorics, 2012
- The bondage numbers and efficient dominations of vertex-transitive graphsDiscrete Mathematics, 2008
- Efficient dominating sets in Cayley graphsDiscrete Applied Mathematics, 2003
- Independent perfect domination sets in Cayley graphsJournal of Graph Theory, 2001
- Perfect codes over graphsJournal of Combinatorial Theory, Series B, 1986
- Perfect codes in graphsJournal of Combinatorial Theory, Series B, 1973