H. Abdollahzadeh Ahangar, Maximal Roman domination numbers in graphs, Util. Math. 103 (2017), 245–258.
 H. Abdollahzadeh Ahangar, M.P. Alvarez, M. Chellali, S.M. Sheikholeslami, and J.C. Valenzuela-Tripodoro, Triple Roman domination in graphs, Applied Math. Comput. 391 (2021), Article ID: 125444.
 H. Abdollahzadeh Ahangar, J. Amjadi, M. Chellali, S. Nazari-Moghaddam, and S.M. Sheikholeslami, Total Roman reinforcement in graphs., Discuss. Mathe. Graph Theory 39 (2019), no. 4, 787–803.
 H. Abdollahzadeh Ahangar, M. Chellali, D. Kuziak, and V. Samodivkin, On maximal Roman domination in graphs, Int. J. Comput. Math. 93 (2016), no. 7, 1093–1102.
 H. Abdollahzadeh Ahangar, M. Chellali, S.M. Sheikholeslami, M. Soroudi, and L. Volkmann, Total vertex-edge domination in trees, Acta Math. Univ. Comenianae 90 (2021), no. 2, 127–143.
 R. Boutrig, M. Chellali, T.W. Haynes, and S.T. Hedetniemi, Vertex-edge domination in graphs, Aequationes Math. 90 (2016), no. 2, 355–366.
 A. Brandstädt, V.B. Le, and J.P. Spinrad, Graph classes: A survey, SIAM, Philadelphia, 2004.
 E.J. Cockayne, P.A. Dreyer Jr, S.M. Hedetniemi, and S.T. Hedetniemi, Roman domination in graphs, Discrete Math. 278 (2004), no. 1-3, 11–22.
 B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation 85 (1990), no. 1, 12–75.
 M.R. Garey and D.S. Johnson, Computers and Interactability : A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
 T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker Inc. New York, 1998.
 T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker Inc. New York,
 M.A. Henning and A. Pandey, Algorithmic aspects of semitotal domination in graphs, Theor. Comput. Sci. 766 (2019), 46–57.
 B. Krishnakumari, Y. B. Venkatakrishnan, and M. Krzywkowski, Bounds on the vertex–edge domination number of a tree, Comptes Rendus Mathematique 352 (2014), no. 5, 363–366.
 H.N. Kumar and Y.B. Venkata Krishna, Vertex-edge Roman domination in graphs, Kragujevac J. Math. 45 (2021), no. 5, 685–698.
 C.E. Leiserson, R.L. Rivest, T.H. Cormen, and C. Stein, Introduction to Algorithms, MIT press Cambridge, MA, 2001.
 J. Lewis, S.T. Hedetniemi, T.W. Haynes, and G.H. Fricke, Vertex-edge domination, Util. Math. 81 (2010), 193–213.
 J.R. Lewis, Vertex-Edge and Edge-Vertex Domination in Graphs, Ph.D. thesis, Clemson University, Clemson, 2007.
 M.-S. Lin and C.-M. Chen, Counting independent sets in tree convex bipartite graphs, Discrete Appl. Math. 218 (2017), 113–122.
 N. Mahadev and U. Peled, Threshold Graphs and Related Topics, Elsevier, 1995.
 A. Oganian and J. Domingo-Ferrer, On the complexity of optimal microaggregation for statistical disclosure control, Statistical Journal of the United Nations Economic Commission for Europe 18 (2001), no. 4, 345–353.
 B.S. Panda and A. Pandey, Algorithm and hardness results for outer-connected dominating set in graphs, J. Graph Algorithms Appl. 18 (2014), 493–513.
 B.S. Panda, A. Pandey, and S. Paul, Algorithmic aspects of b-disjunctive domination in graphs, J. Comb. Optim. 36 (2018), no. 2, 572–590.
 S. Paul and K. Ranjan, On vertex-edge and independent vertex-edge domination, International Conference on Combinatorial Optimization and Applications, Springer, 2019, pp. 437–448.
 K.W. Peters, Theoretical and Algorithmic Results on Domination and Connectivity, Ph.D. thesis, Clemson University, Clemson, 1986.
 E.N. Satheesh, Some Variations of Domination and Applications, Ph.D. thesis, Mahatma Gandhi University, 2014.
 R. Uehara and Y. Uno, Efficient algorithms for the longest path problem, International Symposium on Algorithms and Computation, Springer, 2004, pp. 871–883.
 D.B. West, Introduction to Graph Theory, Upper Saddle River: Prentice Hall, 2001.
 M. Yannakakis, Node-and edge-deletion NP-complete problems, Proceedings of the tenth annual ACM symposium on Theory of computing, 1978, pp. 253–264.
 R. Ziemann and P. Zyliński, ˙ Vertex-edge domination in cubic graphs, Discrete Math. 343 (2020), no. 11, Article ID: 112075.