Locating a robber on a graph via distance queries

@article{Carraher2012LocatingAR,
  title={Locating a robber on a graph via distance queries},
  author={James M. Carraher and Ilkyoo Choi and Michelle Delcourt and Lawrence H. Erickson and Douglas B. West},
  journal={Theor. Comput. Sci.},
  year={2012},
  volume={463},
  pages={54-61}
}
A cop wants to locate a robber hiding among the vertices of a graph. A round of the game consists of the robber moving to a neighbor of its current vertex (or not moving) and then the cop scanning some vertex to obtain the distance from that vertex to the robber. If the cop can at some point determine where the robber is, then the cop wins; otherwise, the robber wins. We prove that the robber wins on graphs with girth at most 5. We also improve the bounds on a problem of Seager by showing that… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Fault - tolerant metric dimension of graphs , in Convexity in Discrete Structures

S. Kannan Isler, S. Khanna
Ramanujan Math . Soc . Lect . Notes Ser . • 2008

Fault - tolerant metric dimension of graphs , in Convexity in Discrete Structures , Ramanujan Math

S. Kannan V. Isler, S. Khanna
Soc . Lect . Notes Ser . • 2008

Fault-tolerant metric dimension of graphs

C. Hernando, M. Mora, P. J. Slater, D. R. Wood
Convexity in Discrete Structures, Ramanujan Math. Soc. Lect. Notes Ser. 5, • 2008
View 1 Excerpt

Alspach , Searching and sweeping graphs : a brief survey

L. Eroh, M. A. Johnson, O. R. Oellermann
Matematiche • 2004

Landmarks in Graphs

Discrete Applied Mathematics • 1996
View 1 Excerpt

Similar Papers

Loading similar papers…