Infinite Families of Circular and Möbius Ladders that are Total Domination Game Critical

Michael A. Henning, Sandi Klavžar

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

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 languageEnglish
Pages (from-to)2141-2149
Number of pages9
JournalBulletin of the Malaysian Mathematical Sciences Society
Volume41
Issue number4
DOIs
Publication statusPublished - 1 Oct 2018

Keywords

  • Circular ladder
  • Critical graph
  • Game total domination number
  • Möbius ladder
  • Total domination game

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Infinite Families of Circular and Möbius Ladders that are Total Domination Game Critical'. Together they form a unique fingerprint.

Cite this