On the Game Domination Number of Graphs with Given Minimum Degree

@article{Bujts2015OnTG,
  title={On the Game Domination Number of Graphs with Given Minimum Degree},
  author={Csilla Bujt{\'a}s},
  journal={Electr. J. Comb.},
  year={2015},
  volume={22},
  pages={P3.29}
}
In the domination game, introduced by Brešar, Klavžar, and Rall in 2010, Dominator and Staller alternately select a vertex of a graph G. A move is legal if the selected vertex v dominates at least one new vertex – that is, if we have a u ∈ N [v] for which no vertex from N [u] was chosen up to this point of the game. The game ends when no more legal moves can be made, and its length equals the number of vertices selected. The goal of Dominator is to minimize whilst that of Staller is to maximize… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Domination game on trees without leaves at distance four

  • Cs. Bujtás
  • In Proceedings of the 8th Japanese-Hungarian…
  • 2013
Highly Influential
4 Excerpts

Bujtás . Domination game on forests

  • A. Frank, A. Recski, G. Wiener, Cs.
  • Discrete Math .
  • 2015

Bujtás . General upper bound on the game domination number

  • Cs.
  • 2014

Similar Papers

Loading similar papers…