Author:
Kwon Young Soo,Lee Jaeun,Sohn Moo Young
Funder
Yeungnam University
National Research Foundation of Korea
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Biggs, N.: Perfect codes in graphs. J. Combin. Theory Ser. B 15(3), 289–296 (1973)
2. Dejter, I.J., Serra, O.: Efficient dominating sets in Cayley graphs. Discrete Appl. Math. 129(2–3), 319–328 (2003)
3. Feng, R., Huang, H., Zhou, S.: Perfect codes in circulant graphs. Discrete Math. 340(7), 1522–1527 (2017)
4. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs Advanced Topics (Chapter 9). Marcel Dekker Inc, NY (1998)
5. Huang, H., Xia, B., Zhou, S.: Perfect codes in Cayley graphs. SIAM J. Discrete Math. 32(1), 548–559 (2018)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献