Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/20044
Nаziv: | The Toucher-Isolator game | Аutоri: | Dowden Chris Kang Mihyun Mikalački Mirjana Stojaković Miloš |
Dаtum izdаvаnjа: | 2019 | Čаsоpis: | Electronic Journal of Combinatorics | Sažetak: | © The authors. All rights reserved. We introduce a new positional game called `Toucher-Isolator', which is a quan-titative version of a Maker-Breaker type game. The playing board is the set ofedges of a given graph G, and the two players, Toucher and Isolator, claim edgesalternately. The aim of Toucher is to `touch' as many vertices as possible (i.e. tomaximise the number of vertices that are incident to at least one of her chosenedges), and the aim of Isolator is to minimise the number of vertices that are sotouched.We analyse the number of untouched vertices u(G) at the end of the game whenboth Toucher and Isolator play optimally, obtaining results both for general graphsand for particularly interesting classes of graphs, such as cycles, paths, trees, andk-regular graphs. We also provide tight examples. | URI: | https://open.uns.ac.rs/handle/123456789/20044 | ISSN: | 1077-8926 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
Prеglеd/i stаnicа
14
Prоtеklа nеdеljа
7
7
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.