Biased Domination Games: Discrete and Computational Geometry, Graphs, and Games

Tharit Sereekiatdilok; Panupong Vichitkunakorn

Biased Domination Games

Discrete and Computational Geometry, Graphs, and Games

Authors

Tharit Sereekiatdilok
Panupong Vichitkunakorn Prince of Songkla University

Keywords:

biased domination game, biased game domination number, maximal move, minimal move

Abstract

We introduce an extended version of a domination game on a graph, called a biased domination game, in which Dominator or Staller plays more than one move in each turn. We show some relations of biased game domination numbers for different biases.

Downloads

Published

2023-12-31

How to Cite

Sereekiatdilok, T., & Vichitkunakorn, P. (2023). Biased Domination Games: Discrete and Computational Geometry, Graphs, and Games. Thai Journal of Mathematics, 21(4), 775–784. Retrieved from https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1544