REVIEW
Eternally surrounding a robber
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Eternally surrounding a robber
read the original abstract
We introduce the bodyguard problem for graphs. This is a variation of Surrounding Cops and Robber but, in this model, a smallest possible group of bodyguards must surround the president and then maintain this protection indefinitely. We investigate some elementary bounds, then solve this problem for the infinite graph families of complete graphs, wheels, trees, cycles, complete multipartite graphs, and two-dimensional grids. We also examine the problem in more general Cartesian, strong, and lexicographic products.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.