RT journal article
T1 Maker-Breaker resolving game played on corona products of graphs
A1 James, T.
A1 Klavžar, S.
A1 Kuziak, Dorota
A1 Savitha, K. S.
A1 Vijayakumar, A.
A2 Estadística e Investigación Operativa
K1 Maker-breaker game
K1 Resolving set
K1 Maker-breaker resolving game
K1 Maker-breaker resolving number
K1 Corona product of graphs
AB The Maker-Breaker resolving game is a game played on a graph G by Resolver andSpoiler. The players taking turns alternately in which each player selects a not yet playedvertex of G. The goal of Resolver is to select all the vertices in a resolving set of G, whilethat of Spoiler is to prevent this from happening. The outcome o(G) of the game playedis one of R, S, and N , where o(G) = R (resp. o(G) = S), if Resolver (resp. Spoiler) hasa winning strategy no matter who starts the game, and o(G) = N , if the first player hasa winning strategy. In this paper, the game is investigated on corona products G  H ofgraphs G and H. It is proved that if o(H) ∈ {N , S}, then o(G  H) = S. No such result ispossible under the assumption o(H) = R. It is proved that o(GPk) = S if k = 5, otherwiseo(G  Pk) = R, and that o(G  Ck) = S if k = 3, otherwise o(G  Ck) = R. Several resultsare also given on corona products in which the second factor is of diameter at most 2
PB Springer
SN 1420-8903
YR 2024
FD 2024-10-24
LK http://hdl.handle.net/10498/35585
UL http://hdl.handle.net/10498/35585
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 10-nov-2026