1. A. Brandstä dt, V. Le, J.P. Spinrad, Graph classes: A survey, in: SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999
2. Roman domination in graphs;Cockayne;Discrete Math.,2004
3. E.J. Cockayne, P.A. Dreyer Jr., S.M. Hedetniemi, A. McRae, Roman domination in graphs II, Manuscript
4. E.J. Cockayne, P.A. Dreyer Jr., S.M. Hedetniemi, S.T. Hedetniemi, A. McRae, The algorithmic complexity of Roman domination, Manuscript
5. A linear time algorithm to compute a dominating pairs in asteroid triple-free graphs;Corneil,1995