References
- B. Bollobas and E.J. Cockayne, Graph-theoretic parameters concerning domination, independence, and irredundance, J. Graph Theory 3 (1979), pp. 241–249. doi: 10.1002/jgt.3190030306
- R. Boutrig, M. Chellali, T.W. Haynes, and S.T. Hedetniemi, Vertex-edge domination in graphs, Aequat. Math. 90 (2016), pp. 355–366. doi: 10.1007/s00010-015-0354-2
- E.J. Cockayne, R.M. Dawes, and S.T. Hedetniemi, Total domination in graphs, Networks 10 (1980), pp. 211–219. doi: 10.1002/net.3230100304
- B. Krishnakumari, Y.B. Venkatakrishnan, and M. Krzywkowski, Bounds on the vertex-edge domination number of a tree, C. R. Acad. Sci. Paris, Ser. I 352 (2014), pp. 363–366. doi: 10.1016/j.crma.2014.03.017
- J.R. Lewis, Vertex-edge and edge-vertex domination in graphs, Ph.D. thesis, Clemson University, 2007.
- J.R. Lewis, S.T. Hedetniemi, T.W. Haynes, and G.H. Fricke, Vertex-edge domination, Util. Math. 81 (2010), pp. 193–213.
- J.W. Peters, Theoretical and algorithmic results on domination and connectivity, Ph.D. thesis, Clemson University, 1986.