Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Builder-Blocker mutual-visibility game
Authors:ID Iršič Chenoweth, Vesna (Author)
ID Klavžar, Sandi (Author)
ID Rus, Gregor (Author)
ID Tan, Elif (Author)
ID Tian, Jing (Author)
Files:.pdf PDF - Presentation file, download (342,16 KB)
MD5: F3956BDA7BEB2D6FCC73E2E2873B3940
 
URL URL - Source URL, visit https://link.springer.com/article/10.1007/s40840-026-02083-9
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:This article discusses mutual-visibility in graphs through a game-based version of the problem. Two players, Builder and Blocker, alternately select an unmarked vertex on a graph keeping the property that the set of marked vertices forms a mutual-visibility set. The game ends when no such selection is possible. The goal of Builder is to create a largest possible mutual-visibility set, Blocker's goal is the opposite. The central problem here is to determine the number of vertices selected during the game assuming that both players played optimally. Bounds on this number are proved and several general properties of the game derived. Special attention is paid to complete multipartite graphs and Hamming graphs.
Keywords:mutual-visibility set, games on graphs, complete multipartite graph, Hamming graph
Publication status:Published
Publication version:Version of Record
Publication date:01.04.2026
Year of publishing:2026
Number of pages:13 str.
Numbering:Vol. 49, iss. 2, article no. 89
PID:20.500.12556/DiRROS-28765 New window
UDC:519.17
ISSN on article:0126-6705
DOI:10.1007/s40840-026-02083-9 New window
COBISS.SI-ID:274047747 New window
Note:
Publication date in DiRROS:02.04.2026
Views:45
Downloads:21
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
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:Bulletin of the Malaysian Mathematical Sciences Society
Shortened title:Bull. Malays. Math. Sci. Soc.
Publisher:Malaysian Mathematical Society, Springer
ISSN:0126-6705
COBISS.SI-ID:515781657 New window

Document is financed by a project

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

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

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-0431
Name:Dominacija v grafih: kubični grafi, produkti in igre

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:Z1-50003
Name:Igra policajev in roparja na grafih in geodetskih prostorih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-70045
Name:Splošna lega in vidnost v teoriji grafov

Funder:TUBITAK - Türkiye Bilimsel ve Teknolojik Araştırma Kurumu
Project number:125F182

Funder:EC - European Commission
Project number:101071836
Name:KARST: Predicting flow and transport in complex Karst systems
Acronym:KARST

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:množica vzajemne vidnosti, igre na grafih, polni multipartitni graf, Hammingov graf


Back