| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:How long can one bluff in the domination game?
Authors:ID Brešar, Boštjan (Author)
ID Dorbec, Paul (Author)
ID Klavžar, Sandi (Author)
ID Košmrlj, Gašper (Author)
Files:.pdf Discussiones_Mathematicae_Graph_Theory_2017_Bresar_et_al._How_long_can_one_bluff_in_the_domination_game.pdf (56,60 KB)
MD5: E2E21DDAD32086F0B202FAFD568E19EF
 
URL http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1899
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:The domination game is played on an arbitrary graph ▫$G$▫ by two players, Dominator and Staller. The game is called Game 1 when Dominator starts it, and Game 2 otherwise. In this paper bluff graphs are introduced as the graphs in which every vertex is an optimal start vertex in Game 1 as well as in Game 2. It is proved that every minus graph (a graph in which Game 2 finishes faster than Game 1) is a bluff graph. A non-trivial infinite family of minus (and hence bluff) graphs is established. Minus graphs with game domination number equal to 3 are characterized. Double bluff graphs are also introduced and it is proved that Kneser graphs ▫$K(n,2)$▫, za ▫$n \ge 6$▫, are double bluff. The domination game is also studied on generalized Petersen graphs and on Hamming graphs. Several generalized Petersen graphs that are bluff graphs but not vertex-transitive are found. It is proved that Hamming graphs are not double bluff.
Keywords:domination game, game domination number, bluff graphs, minus graphs, generalized Petersen graphs, Kneser graphs, Cartesian product of graphs, Hamming graphs
Publication status:Published
Publication version:Version of Record
Submitted for review:19.10.2015
Article acceptance date:07.01.2016
Publisher:University of Zielona Góra
Year of publishing:2017
Number of pages:Str. 337-352
Numbering:Letn. 37, št. 2
PID:20.500.12556/DKUM-65601 New window
ISSN:1234-3099
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:17978457 New window
DOI:10.7151/dmgt.1899 New window
NUK URN:URN:SI:UM:DK:DMQJPGXS
Publication date in DKUM:09.05.2017
Views:1527
Downloads:495
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

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 New window

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.
Licensing start date:09.05.2017

Secondary language

Language:Slovenian
Title:Kako dolgo se lahko pretvarjamo v dominacijski igri?
Abstract:Dominacijsko igro na grafu ▫$G$▫ igrata dva igralca, Dominator in Zavlačevalka. Ko igro začenja Dominator, ji rečemo Igra 1, sicer pa Igra 2. V članku vpeljemo grafe pretvarjanja kot tiste grafe, v katerih je vsako vozlišče optimalno začetno vozlišče za Igro 1 in tudi za Igro 2. V tem članku je dokazano, da je vsak minus graf (to je graf, v katerem se Igra 2 konča hitreje kot Igra 1) tudi graf pretvarjanja. Predstavimo netrivialno neskončno družine minus grafov (in s tem tudi grafov pretvarjanja). Minus grafi z igralnim dominantnim številom enakim 3 so okarakterizirani. Vpeljemo tudi grafe dvojnega pretvarjanja in dokažemo, da so med njimi Kneserjevi grafi, ▫$K(n,2)$▫, za ▫$n \ge 6$▫. Dominacijsko igro obravnavamo tudi v posplošenih Petersenovih grafih in Hammingovih grafih. Odkrijemo več posplošenih Petersenovih grafov, ki so grafi pretvarjanja, niso pa vozliščno tranzitivni. Dokažemo, da Hammingov grafi niso grafi dvojnega pretvarjanja.
Keywords:dominacijska igra, igralno dominantno število, grafi pretvarjanja, minus grafi, posplošeni Petersenovi grafi, Kneserjevi grafi, kartezični produkt grafov, Hammingovi grafi


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica