Maker-breaker resolving game

From MaRDI portal
Publication:2045245

DOI10.1007/S40840-020-01044-0zbMATH Open1470.05115arXiv2005.13242OpenAlexW3106904597MaRDI QIDQ2045245FDOQ2045245


Authors: Cong X. Kang, Sandi Klavžar, Eunjeong Yi, Ismael G. Yero Edit this on Wikidata


Publication date: 12 August 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Abstract: A set of vertices W of a graph G is a resolving set if every vertex of G is uniquely determined by its vector of distances to W. In this paper, the Maker-Breaker resolving game is introduced. The game is played on a graph G by Resolver and Spoiler who alternately select a vertex of G not yet chosen. Resolver wins if at some point the vertices chosen by him form a resolving set of G, whereas Spoiler wins if the Resolver cannot form a resolving set of G. The outcome of the game is denoted by o(G) and RmMB(G) (resp. SmMB(G)) denotes the minimum number of moves of Resolver (resp. Spoiler) to win when Resolver has the first move. The corresponding invariants for the game when Spoiler has the first move are denoted by R'mMB(G) and S'mMB(G). Invariants RmMB(G), R'mMB(G), SmMB(G), and S'mMB(G) are compared among themselves and with the metric dimension mdim(G). A large class of graphs G is constructed for which RmMB(G)>mdim(G) holds. The effect of twin equivalence classes and pairing resolving sets on the Maker-Breaker resolving game is described. As an application o(G), as well as RmMB(G) and R'mMB(G) (or SmMB(G) and S'mMB(G)), are determined for several graph classes, including trees, complete multi-partite graphs, grid graphs, and torus grid graphs.


Full work available at URL: https://arxiv.org/abs/2005.13242




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Maker-breaker resolving game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045245)