{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T04:39:26Z","timestamp":1773981566242,"version":"3.50.1"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:p> Let [Formula: see text] denote the length of a shortest path between vertices [Formula: see text] and [Formula: see text] in a graph [Formula: see text] with vertex set [Formula: see text]. For a positive integer [Formula: see text], let [Formula: see text] and [Formula: see text]. A set [Formula: see text] is a distance-k resolving set of [Formula: see text] if [Formula: see text] for distinct [Formula: see text]. In this paper, we study the maker-breaker distance-[Formula: see text] resolving game (MB[Formula: see text]RG) played on a graph [Formula: see text] by two players, Maker and Breaker, who alternately select a vertex of [Formula: see text] not yet chosen. Maker wins by selecting vertices which form a distance-[Formula: see text] resolving set of [Formula: see text], whereas Breaker wins by preventing Maker from winning. We denote by [Formula: see text] the outcome of MB[Formula: see text]RG. Let [Formula: see text], [Formula: see text] and [Formula: see text], respectively, denote the outcome for which Maker, Breaker, and the first player has a winning strategy in MB[Formula: see text]RG. Given a graph [Formula: see text], the parameter [Formula: see text] is a non-decreasing function of [Formula: see text] with codomain [Formula: see text]. We exhibit pairs [Formula: see text] and [Formula: see text] such that the ordered pair [Formula: see text] realizes each member of the set [Formula: see text]; we provide graphs [Formula: see text] such that [Formula: see text], [Formula: see text] and [Formula: see text] for [Formula: see text]. Moreover, we obtain some general results on MB[Formula: see text]RG and study the MB[Formula: see text]RG played on some graph classes. <\/jats:p>","DOI":"10.1142\/s1793830923500064","type":"journal-article","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T06:36:27Z","timestamp":1672727787000},"source":"Crossref","is-referenced-by-count":2,"title":["Maker-Breaker metric resolving games on graphs"],"prefix":"10.1142","volume":"16","author":[{"given":"Cong X.","family":"Kang","sequence":"first","affiliation":[{"name":"Texas A&M University at Galveston, Galveston, Texas 77553, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunjeong","family":"Yi","sequence":"additional","affiliation":[{"name":"Texas A&M University at Galveston, Galveston, Texas 77553, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"S1793830923500064BIB001","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.1281.c7f"},{"key":"S1793830923500064BIB002","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735202"},{"key":"S1793830923500064BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884015"},{"key":"S1793830923500064BIB004","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025745406160"},{"key":"S1793830923500064BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111955"},{"key":"S1793830923500064BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90005-8"},{"key":"S1793830923500064BIB008","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxaa009"},{"key":"S1793830923500064BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.11.019"},{"key":"S1793830923500064BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2022.04.021"},{"key":"S1793830923500064BIB011","unstructured":"M. Gardner ,  The Scientific American Book of Mathematical Puzzles and Diversions  (Simon & Schuster,  New York,  1959),  pp. 73\u201383."},{"key":"S1793830923500064BIB012","volume-title":"Computers and Intractability : A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"S1793830923500064BIB014","first-page":"191","volume":"2","author":"Harary F.","year":"1976","journal-title":"Ars Combin."},{"key":"S1793830923500064BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0825-5"},{"key":"S1793830923500064BIB016","doi-asserted-by":"publisher","DOI":"10.37236\/302"},{"key":"S1793830923500064BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.07.025"},{"key":"S1793830923500064BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/s40840-020-01044-0"},{"key":"S1793830923500064BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00106-2"},{"issue":"3","key":"S1793830923500064BIB020","first-page":"302","volume":"5","author":"Klein D. J.","year":"2012","journal-title":"Eur. J. Pure Appl. Math."},{"key":"S1793830923500064BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90160-7"},{"key":"S1793830923500064BIB022","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1030.0070"},{"key":"S1793830923500064BIB023","first-page":"549","volume":"14","author":"Slater P. J.","year":"1975","journal-title":"Congr. Numer."},{"key":"S1793830923500064BIB026","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64843-5_39"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923500064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T08:42:05Z","timestamp":1702370525000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923500064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,25]]},"references-count":22,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["10.1142\/S1793830923500064"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923500064","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,25]]},"article-number":"2350006"}}