Game domination number
The dominating set of a digraph \(D\) is a set \(S\) of vertices such that for every \(v\not\in S\) there exists \(u\in S\) with \(uv\in A(D)\). The domination number of \(D\) is the cardinality of the smallest dominating set. The game domination number of an undirected graph \(G\) is the domination number of the digraph \(D\) obtained as a result of the following game, where both players play optimally. Two players orient the edges of \(G\) alternatively and the first player (second player) tries to minimize (maximize) the domination number of \(D\). The authors determine the game domination number for several families of graphs and prove general inequalities.
- On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers
- The variety of domination games
- The domination number of round digraphs
- Game domination subdivision number of a graph
- Proof of a conjecture on game domination
- An introduction to game domination in graphs
- Domination in digraphs
- scientific article; zbMATH DE number 7355464 (Why is no real title available?)
- Game $k$-Domination Number of Graphs
- Roman game domination number of a graph
- Domination game on powers of cycles
- Paired-domination game played on cycles
- Bounds for the competition-independence game on trees
- A greedy partition lemma for directed domination
- A proof of the 3/4-conjecture for the total domination game
- Maker-Breaker domination game
This page was built for publication: Game domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849910)
