4 papers
Results on Cartesian -capacity of graphs
Mateja GraÅ¡iÄ, Christopher Mouron, AljoÅ¡a Å ubaÅ¡iÄ +2
The concept of graph capacity extends graph span by considering the maximum number of agents that can simultaneously traverse a graph while preserving a prescribed minimum distance…
Patrolling cop vs omniscient robber
Nina Chiarelli, Paul Dorbec, MiloÅ¡ StojakoviÄ +1
We study a variant of the classical Cops and Robbers game with one cop and one robber. The cop follows a fixed walk on the graph, called a patrol, that is chosen before the game be…
The radius capture number
Tanja Dravec, Vesna IrÅ¡iÄ Chenoweth, Andrej Taranenko
In the classic cop and robber game, two players--the cop and the robber--take turns moving to a neighboring vertex or staying at their current position. The cop aims to capture the…
The strong vertex span of trees
Mateja GraÅ¡iÄ, Chris Mouron, Andrej Taranenko
The strong vertex (edge) span of a given graph is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of and moving either t…