Elsevier

Discrete Applied Mathematics

Volume 254, 15 February 2019, Pages 107-112
Discrete Applied Mathematics

A note on the localization number of random graphs: Diameter two case

https://doi.org/10.1016/j.dam.2018.06.006Get rights and content
Under an Elsevier user license
open archive

Abstract

We study the localization game on dense random graphs. In this game, a cop x tries to locate a robber y by asking for the graph distance of y from every vertex in a sequence of sets W1,W2,,W. We prove high probability upper and lower bounds for the minimum size of each Wi that will guarantee that x will be able to locate y.

Keywords

Localization game
Random graphs

Cited by (0)