Mostrar el registro sencillo del ítem
Maker-Breaker resolving game played on corona products of graphs
| dc.contributor.author | James, T. | |
| dc.contributor.author | Klavžar, S. | |
| dc.contributor.author | Kuziak, Dorota | |
| dc.contributor.author | Savitha, K. S. | |
| dc.contributor.author | Vijayakumar, A. | |
| dc.contributor.other | Estadística e Investigación Operativa | es_ES |
| dc.date.accessioned | 2025-02-24T10:39:35Z | |
| dc.date.available | 2025-02-24T10:39:35Z | |
| dc.date.issued | 2024-10-24 | |
| dc.identifier.issn | 1420-8903 | |
| dc.identifier.issn | 0001-9054 | |
| dc.identifier.uri | http://hdl.handle.net/10498/35585 | |
| dc.description.abstract | 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 R, S, and N , where o(G) = R (resp. o(G) = S), if Resolver (resp. Spoiler) has a winning strategy no matter who starts the game, and o(G) = N , if the first player has a winning strategy. In this paper, the game is investigated on corona products G H of graphs G and H. It is proved that if o(H) ∈ {N , S}, then o(G H) = S. No such result is possible under the assumption o(H) = R. It is proved that o(GPk) = S if k = 5, otherwise o(G Pk) = R, and that o(G Ck) = S if k = 3, otherwise o(G Ck) = R. Several results are also given on corona products in which the second factor is of diameter at most 2 | es_ES |
| dc.format | application/pdf | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | Springer | es_ES |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.source | Aequationes Mathematicae, 2024 | es_ES |
| dc.subject | Maker-breaker game | es_ES |
| dc.subject | Resolving set | es_ES |
| dc.subject | Maker-breaker resolving game | es_ES |
| dc.subject | Maker-breaker resolving number | es_ES |
| dc.subject | Corona product of graphs | es_ES |
| dc.title | Maker-Breaker resolving game played on corona products of graphs | es_ES |
| dc.type | journal article | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.identifier.doi | 10.1007/s00010-024-01132-7 | |
| dc.type.hasVersion | VoR | es_ES |
Ficheros en el ítem
Este ítem aparece en la(s) siguiente(s) colección(ones)
-
Artículos Científicos [12059]
-
Articulos Científicos Est. I.O. [362]
