20.500.12556/DiRROS-23899 Maker-Breaker resolving game played on corona products of graphs The Maker-Breaker resolving game is a game played on a graph $G$ by Resolver and Spoiler. The players taking turns alternately in which each player selects a not yet played vertex of $G$. The goal of Resolver is to select all the vertices in a resolving set of $G$, while that of Spoiler is to prevent this from happening. The outcome $o(G)$ of the game played is one of $\mathcal{R}$, $\mathcal{S}$, and $\mathcal{N}$, where $o(G)=\mathcal{R}$ (resp. $o(G)=\mathcal{S}$), if Resolver (resp. Spoiler) has a winning strategy no matter who starts the game, and $o(G)=\mathcal{N}$, if the first player has a winning strategy. In this paper, the game is investigated on corona products $G\odot H$ of graphs $G$ and $H$. It is proved that if $o(H)\in\{\mathcal{N}, \mathcal{S}\}$, then $o(G\odot H) = \mathcal{S}$. No such result is possible under the assumption $o(H) = \mathcal{R}$. It is proved that $o(G\odot P_k) = \mathcal{S}$ if $k=5$, otherwise $o(G\odot P_k) = \mathcal{R}$, and that $o(G\odot C_k) = \mathcal{S}$ if $k=3$, otherwise $o(G\odot C_k) = \mathcal{R}$. Several results are also given on corona products in which the second factor is of diameter at most $2$. Maker-Breaker game resolving set Maker-Breaker resolving game Maker-Breaker resolving number corona product of graphs igra izdelovalec-lomilec solventna množica solventna igra izdelovalec-lomilec solventno število izdelovalec-lomilec koronski produkt grafov true false true Angleški jezik Slovenski jezik Neznano 2025-10-20 13:45:11 2025-10-20 13:45:12 2025-10-24 03:55:15 0000-00-00 00:00:00 2025 0 0 str. 1221-1233 iss. 3 Vol. 99 Jun. 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-06-01 519.17 0001-9054 10.1007/s00010-024-01132-7 238692355 s00010-024-01132-7_(1).pdf s00010-024-01132-7_(1).pdf 1 BE5431CE523BEE4C644A84B84A47D1AF 0a67854aac4b947c514799134af9402bb965a5c0eb52f5cfa846bad5e4a418e9 e1561ee7-adaa-11f0-9bb7-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=35460 https://link.springer.com/article/10.1007/s00010-024-01132-7 1 3ef2925b-adaa-11f0-9bb7-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=35459 Inštitut za matematiko, fiziko in mehaniko 0 0 0