An Introduction to Game Domination in Graphs

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Citation (Scopus)


The domination game belongs to the growing family of competitive optimization graph games, and describes a process in which two players, Dominator and Staller, take turns choosing a vertex from a graph G. Each vertex chosen must dominate at least one vertex not dominated by the set of vertices previously chosen. The game ends when there are no more moves available. The players have conflicting goals: while Dominator wants to minimize the size of a dominating set, Staller wants to maximize it. In this chapter, we present selected results on three domination-type game parameters, namely the domination game, the total domination game, and the independent domination game.

Original languageEnglish
Title of host publicationDevelopments in Mathematics
Number of pages25
Publication statusPublished - 2021

Publication series

NameDevelopments in Mathematics
ISSN (Print)1389-2177
ISSN (Electronic)2197-795X


  • Domination
  • Game domination

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'An Introduction to Game Domination in Graphs'. Together they form a unique fingerprint.

Cite this