The variety of domination games

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc, Sandi Klavžar, Gašper Košmrlj, Tilen Marc, Balázs Patkós, Z. Tuza, Máté Vizer

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Domination game (Brešar et al. in SIAM J Discrete Math 24:979–991, 2010) and total domination game (Henning et al. in Graphs Comb 31:1453–1462 (2015) are by now well established games played on graphs by two players, named Dominator and Staller. In this paper, Z-domination game, L-domination game, and LL-domination game are introduced as natural companions of the standard domination games. Versions of the Continuation Principle are proved for the new games. It is proved that in each of these games the outcome of the game, which is a corresponding graph invariant, differs by at most one depending whether Dominator or Staller starts the game. The hierarchy of the five domination games is established. The invariants are also bounded with respect to the (total) domination number and to the order of a graph. Values of the three new invariants are determined for paths up to a small constant independent from the length of a path. Several open problems and a conjecture are listed. The latter asserts that the L-domination game number is not greater than 6 / 7 of the order of a graph.

Original languageEnglish
JournalAequationes Mathematicae
DOIs
Publication statusPublished - Jan 1 2019

Fingerprint

Domination
Game
Graph in graph theory
Total Domination
Total Domination number
Graph Invariants
Path
Invariant
Continuation
Open Problems

Keywords

  • Domination game
  • Grundy domination number
  • L-domination game
  • Total domination game
  • Z-domination game

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Brešar, B., Bujtás, C., Gologranc, T., Klavžar, S., Košmrlj, G., Marc, T., ... Vizer, M. (2019). The variety of domination games. Aequationes Mathematicae. https://doi.org/10.1007/s00010-019-00661-w

The variety of domination games. / Brešar, Boštjan; Bujtás, Csilla; Gologranc, Tanja; Klavžar, Sandi; Košmrlj, Gašper; Marc, Tilen; Patkós, Balázs; Tuza, Z.; Vizer, Máté.

In: Aequationes Mathematicae, 01.01.2019.

Research output: Contribution to journalArticle

Brešar, B, Bujtás, C, Gologranc, T, Klavžar, S, Košmrlj, G, Marc, T, Patkós, B, Tuza, Z & Vizer, M 2019, 'The variety of domination games', Aequationes Mathematicae. https://doi.org/10.1007/s00010-019-00661-w
Brešar B, Bujtás C, Gologranc T, Klavžar S, Košmrlj G, Marc T et al. The variety of domination games. Aequationes Mathematicae. 2019 Jan 1. https://doi.org/10.1007/s00010-019-00661-w
Brešar, Boštjan ; Bujtás, Csilla ; Gologranc, Tanja ; Klavžar, Sandi ; Košmrlj, Gašper ; Marc, Tilen ; Patkós, Balázs ; Tuza, Z. ; Vizer, Máté. / The variety of domination games. In: Aequationes Mathematicae. 2019.
@article{0b644a3b9dc34f149565586e6931561b,
title = "The variety of domination games",
abstract = "Domination game (Brešar et al. in SIAM J Discrete Math 24:979–991, 2010) and total domination game (Henning et al. in Graphs Comb 31:1453–1462 (2015) are by now well established games played on graphs by two players, named Dominator and Staller. In this paper, Z-domination game, L-domination game, and LL-domination game are introduced as natural companions of the standard domination games. Versions of the Continuation Principle are proved for the new games. It is proved that in each of these games the outcome of the game, which is a corresponding graph invariant, differs by at most one depending whether Dominator or Staller starts the game. The hierarchy of the five domination games is established. The invariants are also bounded with respect to the (total) domination number and to the order of a graph. Values of the three new invariants are determined for paths up to a small constant independent from the length of a path. Several open problems and a conjecture are listed. The latter asserts that the L-domination game number is not greater than 6 / 7 of the order of a graph.",
keywords = "Domination game, Grundy domination number, L-domination game, Total domination game, Z-domination game",
author = "Boštjan Brešar and Csilla Bujt{\'a}s and Tanja Gologranc and Sandi Klavžar and Gašper Košmrlj and Tilen Marc and Bal{\'a}zs Patk{\'o}s and Z. Tuza and M{\'a}t{\'e} Vizer",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/s00010-019-00661-w",
language = "English",
journal = "Aequationes Mathematicae",
issn = "0001-9054",
publisher = "Birkhauser Verlag Basel",

}

TY - JOUR

T1 - The variety of domination games

AU - Brešar, Boštjan

AU - Bujtás, Csilla

AU - Gologranc, Tanja

AU - Klavžar, Sandi

AU - Košmrlj, Gašper

AU - Marc, Tilen

AU - Patkós, Balázs

AU - Tuza, Z.

AU - Vizer, Máté

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Domination game (Brešar et al. in SIAM J Discrete Math 24:979–991, 2010) and total domination game (Henning et al. in Graphs Comb 31:1453–1462 (2015) are by now well established games played on graphs by two players, named Dominator and Staller. In this paper, Z-domination game, L-domination game, and LL-domination game are introduced as natural companions of the standard domination games. Versions of the Continuation Principle are proved for the new games. It is proved that in each of these games the outcome of the game, which is a corresponding graph invariant, differs by at most one depending whether Dominator or Staller starts the game. The hierarchy of the five domination games is established. The invariants are also bounded with respect to the (total) domination number and to the order of a graph. Values of the three new invariants are determined for paths up to a small constant independent from the length of a path. Several open problems and a conjecture are listed. The latter asserts that the L-domination game number is not greater than 6 / 7 of the order of a graph.

AB - Domination game (Brešar et al. in SIAM J Discrete Math 24:979–991, 2010) and total domination game (Henning et al. in Graphs Comb 31:1453–1462 (2015) are by now well established games played on graphs by two players, named Dominator and Staller. In this paper, Z-domination game, L-domination game, and LL-domination game are introduced as natural companions of the standard domination games. Versions of the Continuation Principle are proved for the new games. It is proved that in each of these games the outcome of the game, which is a corresponding graph invariant, differs by at most one depending whether Dominator or Staller starts the game. The hierarchy of the five domination games is established. The invariants are also bounded with respect to the (total) domination number and to the order of a graph. Values of the three new invariants are determined for paths up to a small constant independent from the length of a path. Several open problems and a conjecture are listed. The latter asserts that the L-domination game number is not greater than 6 / 7 of the order of a graph.

KW - Domination game

KW - Grundy domination number

KW - L-domination game

KW - Total domination game

KW - Z-domination game

UR - http://www.scopus.com/inward/record.url?scp=85068868124&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068868124&partnerID=8YFLogxK

U2 - 10.1007/s00010-019-00661-w

DO - 10.1007/s00010-019-00661-w

M3 - Article

AN - SCOPUS:85068868124

JO - Aequationes Mathematicae

JF - Aequationes Mathematicae

SN - 0001-9054

ER -