Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference16 articles.
1. Cockayne EJ, Hedetniemi ST (1977) Towards a theory of domination in graphs. Networks 7(3):247–261
2. Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundermentals of domination in graphs. Marcel Dekker, New York
3. Horton JD, Kilakos K (1993) Minimum edge dominating sets. SIAM J Discret Math 6(3):375–387
4. Karp R (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85–104
5. Kalbflisch JG, Stanton R, Horton JD (1971) On covering sets and error correcting codes. J Comb 11A:233–250
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献