Funder
National Natural Science Foundation of China
Fundamental Research Funds for the Central Universities
Foundation of Department of Science and Technology of Henan
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Arumugam, S., Velammal, S.: Connected edge domination in graph. Tamkang J. Math. 24(1), 55–64 (2009)
2. Bondy, J.A., Murty, U.S.R.: Graph theory. In: GTM 244. Springer, Cham (2008)
3. Bhaskarudu, P.: Matching domination of Kronecker product of two graphs. Int. J. Adv. Res. Ideas Innov. Technol. 2(5), 937–944 (2017)
4. Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153–180 (1994)
5. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and MANETs. In: Handbook of Combinatorial Optimization, pp. 329–369. Springer, New York (2005)