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

DOI10.1016/j.dam.2018.06.006zbMath1404.05129arXiv1712.03311OpenAlexW2962805976MaRDI QIDQ1720315

Wesley Pegden, Andrzej Dudek, Alan M. Frieze

Publication date: 8 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphslocalization game

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (10)

The localization game on oriented graphs ⋮ Edge and pair queries-random graphs and complexity ⋮ The localization number of designs ⋮ Unnamed Item ⋮ The localization game on Cartesian products ⋮ Localization game for random graphs ⋮ Hyperopic cops and robbers ⋮ Sequential metric dimension for random graphs ⋮ Localization game for random geometric graphs ⋮ The localization capture time of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Metric dimension for random graphs
• Locating a robber on a graph
• Locating a robber on a graph via distance queries
• Locating a robber with multiple probes
• Locating a backtracking robber on a tree

This page was built for publication: A note on the localization number of random graphs: diameter two case