Results 1 
4 of
4
On a Generalization of Meyniel’s Conjecture on the Cops and Robbers Game
"... We consider a variant of the Cops and Robbers game where the robber can move s edges at a time, and show that in this variant, the cop number of a connected graph on n vertices can be as large as Ω(n s s+1). This improves the Ω(n s−3 s−2) lower bound of Frieze et al. [5], and extends the result of t ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
(Show Context)
We consider a variant of the Cops and Robbers game where the robber can move s edges at a time, and show that in this variant, the cop number of a connected graph on n vertices can be as large as Ω(n s s+1). This improves the Ω(n s−3 s−2) lower bound of Frieze et al. [5], and extends the result of the second author [10], which establishes the above bound for s = 2, 4. 1
Cops and robber game with a fast robber
, 2011
"... Graph searching problems are described as games played on graphs, between a set of searchers and a fugitive. Variants of the game restrict the abilities of the searchers and the fugitive and the corresponding search number (the least number of searchers that have a winning strategy) is related to ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Graph searching problems are described as games played on graphs, between a set of searchers and a fugitive. Variants of the game restrict the abilities of the searchers and the fugitive and the corresponding search number (the least number of searchers that have a winning strategy) is related to several wellknown parameters in graph theory. One popular variant is called the Cops and Robber game, where the searchers (cops) and the fugitive (robber) move in rounds, and in each round they move to an adjacent vertex. This game, defined in late 1970’s, has been studied intensively. The most famous open problem is Meyniel’s conjecture, which states that the cop number (the minimum number of cops that can always capture the robber) of a connected graph on n vertices is O( n). We consider a version of the Cops and Robber game, where the robber is faster than the cops, but is not allowed to jump over the cops. This version was first studied in 2008. We show that when the robber has speed s, the cop number of a connected nvertex graph can be as large as Ω(ns/s+1). This improves the Ω(n s−3 s−2) lower bound of Frieze, Krivelevich, and Loh (Variations on Cops and Robbers, J. Graph Theory, to appear). We also conjecture a general upper bound O(ns/s+1) for the cop number, generalizing Meyniel’s conjecture. Then we focus on the version where the robber is infinitely fast, but is again not allowed to jump over the cops. We give a mathematical characterization for graphs with cop number one. For a graph with treewidth tw and maximum degree ∆, we prove the cop number is between tw+1 ∆+1 and tw + 1. Using this we show that the cop number of the
COPS AND ROBBER WITH CONSTRAINTS
, 2012
"... Cops & Robber is a classical pursuitevasion game on undirected graphs, where the task is to identify the minimum number of cops sufficient to catch the robber. In this paper, we investigate the changes in problem’s complexity and combinatorial properties with constraining the following natural ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Cops & Robber is a classical pursuitevasion game on undirected graphs, where the task is to identify the minimum number of cops sufficient to catch the robber. In this paper, we investigate the changes in problem’s complexity and combinatorial properties with constraining the following natural game parameters • Fuel: The number of steps each cop can make; • Cost: The total sum of steps along edges all cops can make;