Acknowledgement
This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2020R1I1A3A04036669).
References
- R. Boutrig, M. Chellali, T. W. Haynes, and S. T. Hedetniemi, Vertex-edge domination in graphs, Aequationes Math. 90 (2016), no. 2, 355-366. https://doi.org/10.1007/s00010-015-0354-2
- E. J. Cockayne, S. Goodman, and S. T. Hedetniemi, A linear algorithm for the domination number of a tree, Inform. Process. Lett. 4 (1975) 41-44. https://doi.org/10.1016/0020-0190(75)90011-3
- S. T. Hedetniemi, R. Laskar, and J. Pfaff, A linear algorithm for finding a minimum dominating set in a cactus, Discrete Appl. Math. 13 (1986), no. 2-3, 287-292. https://doi.org/10.1016/0166-218X(86)90089-2
- B. Krishnakumari, M. Chellali, and Y. B. Venkatakrishnan, Double vertex-edge domination, Discrete Math. Algorithms Appl. 9 (2017), no. 4, 1750045, 11 pp. https://doi.org/10.1142/S1793830917500458
- B. Krishnakumari, Y. B. Venkatakrishnan, and M. Krzywkowski, Bounds on the vertex-edge domination number of a tree, C. R. Math. Acad. Sci. Paris 352 (2014), no. 5, 363-366. https://doi.org/10.1016/j.crma.2014.03.017
- J. Lewis, S. T. Hedetniemi, T. W. Haynes, and G. H. Fricke, Vertex-edge domination, Util. Math. 81 (2010), 193-213.
- J. W. Peters, Theoretical and algorithmic results on domination and connectivity, Ph.D. thesis, Clemson University, 1986.
- Y. Zhao, Z. Liao, and L. Miao, On the algorithmic complexity of edge total domination, Theoret. Comput. Sci. 557 (2014), 28-33. https://doi.org/10.1016/j.tcs.2014.08.005