Localization Game for Random Graphs
Combinatorics
2020-09-07 v2
Abstract
We consider the localization game played on graphs in which a cop tries to determine the exact location of an invisible robber by exploiting distance probes. The corresponding graph parameter for a given graph is called the localization number. In this paper, we improve the bounds for dense random graphs determining an asymptotic behaviour of . Moreover, we extend the argument to sparse graphs.
Cite
@article{arxiv.1910.11225,
title = {Localization Game for Random Graphs},
author = {Andrzej Dudek and Sean English and Alan Frieze and Calum MacRury and Pawel Pralat},
journal= {arXiv preprint arXiv:1910.11225},
year = {2020}
}