Capture times in the Bridge-burning Cops and Robbers game

10/31/2020
by   Rebekah Herrman, et al.
0

In this paper, we consider a variant of the cops and robbers game on a graph, introduced by Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from the graph, known as bridge-burning cops and robbers. In particular, we study the maximum time it takes the cops to capture the robber.

READ FULL TEXT
research
12/24/2018

Cops, robbers, and burning bridges

We consider a variant of Cops and Robbers wherein each edge traversed by...
research
02/10/2019

Expected capture time and throttling number for cop versus gambler

We bound expected capture time and throttling number for the cop versus ...
research
12/28/2020

The graph energy game

We study the graph energy from a cooperative game viewpoint. We introduc...
research
10/31/2017

Variations of the cop and robber game on graphs

We prove new theoretical results about several variations of the cop and...
research
05/26/2020

How the planned V0 railway line would increase the resilience of the railway network of Hungary against attacks

The spatial distribution of the railway crossings on the river Danube in...
research
04/22/2022

The mixed search game against an agile and visible fugitive is monotone

We consider the mixed search game against an agile and visible fugitive....
research
04/29/2014

Assessing the players'performance in the game of bridge: A fuzzy logic approach

Contract bridge occupies nowadays a position of great prestige being, to...

Please sign up or login with your details

Forgot password? Click here to reset