Lower bounds of location numbers

DOI10.1007/978-3-032-17156-6_11MaRDI QIDQ7307315zbMATH OpenFDO

Authors Rahul Das, Soumen Nandi, Ushnish Sarkar

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A robber locating strategy for trees
• A sequential locating game on graphs
• Chasing robbers on random geometric graphs-an alternative approach
• Chasing robbers on random graphs: zigzag theorem
• Cops and robbers in a random graph
• Cops and robbers in graphs with large girth and Cayley graphs
• scientific article; zbMATH DE number 3825594 (Why is no real title available?)
• 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?)
• Locating a backtracking robber on a tree
• Locating a robber on a graph
• Locating a robber on a graph via distance queries
• Resolvability and the upper dimension of graphs
• Sequential metric dimension
• Sequential metric dimension for random graphs
• Subdivisions in the robber locating game
• The robber locating game
• Vertex-to-vertex pursuit in a graph

This page was built for publication: Lower bounds of location numbers

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