A strategy for isolator in the toucher-isolator game on trees

From MaRDI portal
Publication:2064906

DOI10.1007/S40840-021-01178-9zbMATH Open1479.05222arXiv2005.01931OpenAlexW3198776385MaRDI QIDQ2064906FDOQ2064906

Teeradej Kittipassorn, Sopon Boriboon

Publication date: 6 January 2022

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

Abstract: In the Toucher-Isolator game, introduced recently by Dowden, Kang, Mikalav{c}ki and Stojakovi'{c}, Toucher and Isolator alternately claim an edge from a graph such that Toucher aims to touch as many vertices as possible, while Isolator aims to isolate as many vertices as possible, where Toucher plays first. Among trees with n vertices, they showed that the star is the best choice for Isolator and they asked for the most suitable tree for Toucher. Later, R"{a}ty showed that the answer is the path with n vertices. We give a simple alternative proof of this result. The method to determine where Isolator should play is by breaking down the gains and losses in each move of both players.


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




Recommendations




Cites Work






This page was built for publication: A strategy for isolator in the toucher-isolator game on trees

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