Publisher
Springer Nature Switzerland
Reference23 articles.
1. Araki, T., Yamanaka, R.: Secure domination in cographs. Discret. Appl. Math. 262, 179–184 (2019)
2. Arumugam, S., Ebadi, K., Manrique, M.: Co-secure and secure domination in graphs. Util. Math. 94, 167–182 (2014)
3. Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inform. Process. Lett. 19(1), 37–40 (1984)
4. Boumediene Merouane, H., Chellali, M.: On secure domination in graphs. Inform. Process. Lett. 115(10), 786–790 (2015)
5. Brandstädt, A., Chepoi, V.D., Dragan, F.F.: The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discret. Appl. Math. 82(1–3), 43–77 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献