|
Total domination game on ladder graphs |
|---|---|
| รหัสดีโอไอ | |
| Creator | 1. Karnchana Charoensitthichai 2. Chalermpong Worawannotai |
| Title | Total domination game on ladder graphs |
| Publisher | Research and Development Office, Prince of Songkla University |
| Publication Year | 2564 |
| Journal Title | Songklanakarin Journal of Science and Technology (SJST) |
| Journal Vol. | 43 |
| Journal No. | 2 |
| Page no. | 492-495 |
| Keyword | total domination game, Game total domination number, ladder, circular ladder, M?bius ladder |
| URL Website | https://rdo.psu.ac.th/sjstweb/index.php |
| ISSN | 0125-3395 |
| Abstract | The total domination game is played on a simple graph G by two players, named Dominator and Staller. Theyalternately select a vertex of G; each chosen vertex totally dominates its neighbors. In this game, each chosen vertex must totallydominate at least one new vertex not totally dominated before. The game ends when all vertices in G are totally dominated.Dominator's goal is to finish the game as soon as possible, and Staller's goal is to prolong it as much as possible. The game totaldomination number is the number of chosen vertices when both players play optimally. There are two types of such number, onewhere Dominator starts the game and another where Staller starts the game. In this paper, we determine the game totaldomination numbers of the ladders, the circular ladders and the M?bius ladders. |
