References
- S. Arumugam and S. Velammal, Edge domination in graphs, Taiwanese J. Math.2(2) (1998), pp. 173–179
- J. A. Bondy and U. S.R. Murty, Graph Theory. Graduate Texts in Mathematics, Springer, New York, 2008
- R. Forcade, Smallest maximal matching in the graph of the d-dimensional cube, J. Comb. Theory Ser. B14 (1973), pp. 153–156 doi: 10.1016/0095-8956(73)90059-2
- T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998
- J. D. Horton and K. Kilakos, Minimum edge dominating sets, SIAM J. Discrete Math.6(3) (1993), pp. 375–387 doi: 10.1137/0406030
- V.R. Kulli and D.K. Patwari, On the edge total domination number of a graph, Proceedings of the Symposium on Graph Theory and Combinatorics (Cochin, 1991), Publication, 21, Centre for Mathematical Sciences, Trivandrum, 1991, pp. 75–81.
- C. L. Lu, M. T. Ko and C. Y. Tang, Perfect edge domination and efficient edge domination in graphs, Discrete Appl. Math.119(3) (2002), pp. 227–250 doi: 10.1016/S0166-218X(01)00198-6
- S. Mitchell and S. T. Hedetniemi, Edge domination in trees, Congr. Numer.19 (1977), pp. 489–509
- B. Xu, Two classes of edge domination in graphs, Discrete Appl. Math.154 (2006), pp. 1541–1546 doi: 10.1016/j.dam.2005.12.007
- M. Yannakakis and F. Gavril, Edge dominating sets in graphs, SIAM J. Appl. Math.38(3) (1980), pp. 364–372 doi: 10.1137/0138030
- M. Zhao and E. F. Shan, Minus edge domination in graphs, Ars Combin.93 (2009), pp. 105–112