Builder-Blocker mutual-visibility game

Iršič Chenoweth, Vesna (avtor), Klavžar, Sandi (avtor), Rus, Gregor (avtor), Tan, Elif (avtor), Tian, Jing (avtor)

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.

• Jezik: Angleški jezik
• Ključne besede: mutual-visibility set, games on graphs, complete multipartite graph, Hamming graph
• Vrsta gradiva: Članek v reviji
• Tipologija: 1.01 - Izvirni znanstveni članek
• Organizacija: FMF - Fakulteta za matematiko in fiziko
• Status publikacije: Objavljeno
• Različica publikacije: Objavljena publikacija
• Datum objave: 01.04.2026
• Leto izida: 2026
• Št. strani: 13 str.
• Številčenje: Vol. 49, iss. 2, article no. 89
• PID: 20.500.12556/RUL-181356
• UDK: 519.17
• ISSN pri članku: 0126-6705
• DOI: 10.1007/s40840-026-02083-9
• COBISS.SI-ID: 274047747
• Datum objave v RUL: 02.04.2026

Gradivo je del revije

• Naslov: Bulletin of the Malaysian Mathematical Sciences Society
• Skrajšan naslov: Bull. Malays. Math. Sci. Soc.
• Založnik: Malaysian Mathematical Society, Springer
• ISSN: 0126-6705
• COBISS.SI-ID: 515781657

Licence

• Licenca: CC BY 4.0, Creative Commons Priznanje avtorstva 4.0 Mednarodna
• Povezava: http://creativecommons.org/licenses/by/4.0/deed.sl
• Opis: To je standardna licenca Creative Commons, ki daje uporabnikom največ možnosti za nadaljnjo uporabo dela, pri čemer morajo navesti avtorja.

Sekundarni jezik

• Jezik: Slovenski jezik
• Ključne besede: množica vzajemne vidnosti, igre na grafih, polni multipartitni graf, Hammingov graf