1. R.B. Allan, R.C. Laskar, On domination and some related concepts in graph theory, in Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1978). Congr. Numer., vol. XXI (Utilitas Math., Winnipeg, 1978), pp. 43–56
2. R.B. Allan, R.C. Laskar, S.T. Hedetniemi, A note on total domination. Discrete Math. 49(1), 7–13 (1984)
3. M. Aouchiche, O. Favaron, P. Hansen, Variable neighborhood search for extremal graphs. XXII. Extending bounds for independence to upper irredundance. Discrete Appl. Math. 157, 3497–3510 (2009)
4. G. Bacsó, O. Favaron, Independence, irredundance, degrees and chromatic number in graphs. Discrete Math. 259, 257–262 (2002)
5. C. Bazgan, L. Brankovic, K. Casel, H. Fernau, On the complexity landscape of the domination chain, in Algorithms and Discrete Applied Mathematics. Lecture Notes in Computer Science, vol. 9602 (Springer, Cham, 2016), pp. 61–72