ABSTRACT
Domination and other related concepts in undirected graphs are well studied. Recently, two special volumes appeared containing research papers dealing only with these topics [49], [58]. The need for a concise survey of the many types of domination models is long overdue. In this book such topics are dealt with primarily for undirected graphs. Although domination and related topics have been extensively studied, the respective analogs on digraphs have not received much attention. Such studies in the directed case have concentrated mainly on kernels, because of its applications to game theory and other areas, as discussed in Sections 15.3 and 15.8. In this chapter we present results concerning domination, kernels, and solutions in digraphs along with applications in game theory.
