1. Bange, D.W., Barkauskas, A.E., Slater, P.J.: Efficient dominating sets in graphs. In: Ringeisen, R.D., Roberts, F.S. (eds.) Applications of Discrete Mathematics, pp. 189–199. SIAM, Philadelphia (1988)
2. Bange, D.W., Barkauskas, A.E., Host, L.H., Slater, P.J.: Generalized domination and efficient domination in graphs. Discrete Math. 159, 1–11 (1996)
3. Biggs, N.: Perfect codes in graphs. J. Comb. Theory Ser. B 15, 289–296 (1973)
4. Brandstädt, A.: Weighted efficient domination for $$P_5$$ -free graphs in linear time. CoRR arXiv:1507.06765v1 (2015)
5. Brandstädt, A., Chepoi, V.D., Dragan, F.F.: The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discrete Appl. Math. 82, 43–77 (1998)