A note on robber locating game

DOI10.1016/J.DAM.2025.12.061MaRDI QIDQ6848832zbMATH OpenFDO

Authors Rahul Das, Ushnish Sarkar

Publication date 5 March 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.12.061

zbMATH Keywords

diameterhideoutlocation numberlower boundmetric dimensionrobber locating game

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites work

• A note on the localization number of random graphs: diameter two case
• A sequential locating game on graphs
• Bounds on the localization number
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
• Guard games on graphs: keep the intruder out!
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• Landmarks in graphs
• Localization game on geometric and planar graphs
• Locating a backtracking robber on a tree
• Locating a robber on a graph
• Locating a robber on a graph via distance queries
• Locating a robber with multiple probes
• Sequential metric dimension
• Sequential metric dimension for random graphs
• Subdivisions in the robber locating game
• The localization capture time of a graph
• The robber locating game
• Vertex-to-vertex pursuit in a graph

This page was built for publication: A note on robber locating game

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