1. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1976.
2. J.-C. Bermond, J. Bond, D. Peleg, S. Pérennes, Tight bounds on the size of 2-monopolies, Proceedings of the Third Colloquium on Structural Information & Communication Complexity, Siena, Italy, June 1996, Carleton University Press, pp. 152–169.
3. J.-C. Bermond, D. Peleg, The power of small coalitions in graphs, Proceedings of the Second Colloquium on Structural Information & Communication Complexity, Olympia, Greece, June 1995, Carleton University Press, pp. 173–184.
4. Introduction to Algorithms;Cormen,1990
5. Fundamentals of Domination in Graphs;Haynes,1998