izpis_h1_title_alt

Maker-Breaker domination game on trees when Staller wins
ID Bujtás, Csilla (Author), ID Dokyeesun, Pakanun (Author), ID Klavžar, Sandi (Author)

.pdfPDF - Presentation file, Download (254,36 KB)
MD5: 4F25DFACA34AE0F4CAF70CC07280641C
URLURL - Source URL, Visit https://dmtcs.episciences.org/12202 This link opens in a new window

Abstract
In the Maker-Breaker domination game played on a graph $G$, Dominator's goal is to select a dominating set and Staller's goal is to claim a closed neighborhood of some vertex. We study the cases when Staller can win the game. If Dominator (resp., Staller) starts the game, then $\gamma_{\rm SMB}(G)$ (resp., $\gamma_{\rm SMB}'(G)$) denotes the minimum number of moves Staller needs to win. For every positive integer $k$, trees $T$ with $\gamma_{\rm SMB}'(T)=k$ are characterized and a general upper bound on $\gamma_{\rm SMB}'$ is proved. Let $S = S(n_1,\dots, n_\ell)$ be the subdivided star obtained from the star with $\ell$ edges by subdividing its edges $n_1-1, \ldots, n_\ell-1$ times, respectively. Then $\gamma_{\rm SMB}'(S)$ is determined in all the cases except when $\ell\ge 4$ and each $n_i$ is even. The simplest formula is obtained when there are at least two odd $n_i$s. If ▫$n_1$▫ and $n_2$ are the two smallest such numbers, then $\gamma_{\rm SMB}'(S(n_1,\dots, n_\ell))=\lceil \log_2(n_1+n_2+1)\rceil$▫. For caterpillars, exact formulas for $\gamma_{\rm SMB}$ and for $\gamma_{\rm SMB}'$ are established.

Language:English
Keywords:domination game, Maker-Breaker game, Maker-Breaker domination game, hypergraphs, trees, subdivided stars, caterpillars
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FMF - Faculty of Mathematics and Physics
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2023
Year:2023
Number of pages:21 str.
Numbering:Vol. 25, no. 2, [article no.] 12
PID:20.500.12556/RUL-155607 This link opens in a new window
UDC:519.17
ISSN on article:1365-8050
DOI:10.46298/dmtcs.10515 This link opens in a new window
COBISS.SI-ID:164065283 This link opens in a new window
Publication date in RUL:08.04.2024
Views:57
Downloads:8
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Record is a part of a journal

Title:Discrete mathematics & theoretical computer science
Shortened title:Discret. math. theor. comput. sci.
Publisher:DMTCS
ISSN:1365-8050
COBISS.SI-ID:8089433 This link opens in a new window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:dominacijska igra, igra izdelovalec-lomilec, dominacijska igra izdelovalec-lomilec, hipergrafi, drevesa, subdividirane zvezde, gosenice

Projects

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-2452
Name:Strukturni, optimizacijski in algoritmični problemi v geometrijskih in topoloških predstavitvah grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:Other - Other funder or multiple funders
Funding programme:The Institute for the Promotion of Teaching Science and Technology (IPST), Thailand
Name:PhD scholarship

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back