Abstract
Let γtg(G) denote the game total domination number of a graph G, and let G|v mean that a vertex v of G is declared to be already totally dominated. A graph G is total domination game critical if γtg(G| v) < γtg(G) holds for every vertex v in G. If γtg(G) = k, then G is further called k-γtg-critical. In this paper, we prove that the circular ladder C4k□K2 is 4k-γtg-critical and that the Möbius ladder ML 2 k is 2k-γtg-critical.
Original language | English |
---|---|
Pages (from-to) | 2141-2149 |
Number of pages | 9 |
Journal | Bulletin of the Malaysian Mathematical Sciences Society |
Volume | 41 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Oct 2018 |
Keywords
- Circular ladder
- Critical graph
- Game total domination number
- Möbius ladder
- Total domination game
ASJC Scopus subject areas
- General Mathematics