EUVIMEDEUVIMED entdecken
Open Access · CC BY-ND 4.0

Cops and robber with decoys

Nancy E. Clarke, Davita DesRoches, Jim Diamond, Moinul Islam

Contributions to Discrete Mathematics · 2026

DOI: 10.55016/dn6kj166 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Contributions to Discrete Mathematics, 2026. Verfasst von Nancy E. Clarke und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We introduce a variation of the Cops and Robber game in which the robber side consists of a robber and a decoy which are indistinguishable to the cops except under certain conditions. The cops win when one of them moves onto the same vertex as the actual robber (i.e.~not the decoy) after a finite number of turns. The robber can throw the decoy to a neighbouring vertex on any turn beyond his first; such a turn for the robber consists of throwing (or dropping) the decoy and then moving. The current decoy disappears as the next is thrown so there is only a single decoy in play at any time. We characterize decoy-copwin graphs in the case where the cop can distinguish between the robber and decoy only when he is on the same vertex as one of them. We also characterize such graphs if the cop can distinguish between the robber and decoy only when he has cornered at least one of them.

Zitieren

APA

Clarke, N. E., DesRoches, D., Diamond, J., & Islam, M. (2026). Cops and robber with decoys. Contributions to Discrete Mathematics. https://doi.org/10.55016/dn6kj166

Vancouver

Clarke NE, DesRoches D, Diamond J, Islam M. Cops and robber with decoys. Contributions to Discrete Mathematics. 2026. doi:10.55016/dn6kj166

BibTeX
@article{Clarke2026,
  author = {Clarke, Nancy E. and DesRoches, Davita and Diamond, Jim and Islam, Moinul},
  title = {Cops and robber with decoys},
  journal = {Contributions to Discrete Mathematics},
  year = {2026},
  doi = {10.55016/dn6kj166}
}
Kostenlos starten →