Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Repository of the University of Ljubljana
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Advanced
New in RUL
About RUL
In numbers
Help
Sign in
Details
Criticality for Maker-Breaker domination games with predomination
ID
Bujtás, Csilla
(
Author
),
ID
Dokyeesun, Pakanun
(
Author
),
ID
Klavžar, Sandi
(
Author
),
ID
Stojaković, Miloš
(
Author
)
PDF - Presentation file,
Download
(251,83 KB)
MD5: CE1154EF8B889465D525E0596ED3F64F
URL - Source URL, Visit
https://www.dmgt.uz.zgora.pl/publish/article.php?doi=2615
Image galllery
Abstract
A predominated graph is a pair $(G,D)$, where $G$ is a graph and the vertices in $D\subseteq V(G)$ are considered already dominated. Maker-Breaker domination game critical (MBD critical) predominated graphs are introduced as the predominated graphs $(G,D)$ on which Staller wins the game, but Dominator wins on $(G, D \cup \{v\})$ for every vertex $v \in V(G) \setminus D$. Tools are developed for handling the Maker-Breaker domination game on trees which lead to a characterization of Staller-win predominated trees. MBD critical predominated trees are characterized and an algorithm is designed which verifies in linear time whether a given predominated tree is MBD critical. A large class of MBD critical predominated cacti is presented and Maker-Breaker critical hypergraphs are constructed.
Language:
English
Keywords:
domination games
,
Maker-Breaker games
,
Maker-Breaker domination game
,
predomination
,
hypergraph
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.2026
Year:
2026
Number of pages:
Str. 483-506
Numbering:
Vol. 46, no. 2
PID:
20.500.12556/RUL-181831
UDC:
519.17
ISSN on article:
1234-3099
DOI:
10.7151/dmgt.2615
COBISS.SI-ID:
275411971
Publication date in RUL:
16.04.2026
Views:
240
Downloads:
108
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Share:
Record is a part of a journal
Title:
Discussiones mathematicae : Graph theory
Shortened title:
Discuss. Math., Graph Theory
Publisher:
Technical University Press
ISSN:
1234-3099
COBISS.SI-ID:
7487065
Licences
License:
CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:
http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:
The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Secondary language
Language:
Slovenian
Keywords:
dominacijske igre
,
igre izdelovalec-lomilec
,
dominacijska igra izdelovalec-lomilec
,
predominacija
,
hipergrafi
Projects
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
P1-0297
Name:
Teorija grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0355
Name:
Prirejanja, transverzale in hipergrafi
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0285
Name:
Metrični problemi v grafih in hipergrafih
Funder:
Science Fund of the Republic of Serbia
Project number:
7462
Name:
Graphs in Space and Time: Graph Embeddings for Machine Learning in Complex Dynamical Systems
Acronym:
TIGRA
Funder:
Provincial Secretariat for Higher Education and Scientific Research, Province of Vojvodina
Project number:
142-451-2686/2021
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back