Cops and robber on some families of oriented graphs

Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Cops and robber game on a directed graph (Formula presented.) initiates by PlayerÂ 1 placing k cops and then PlayerÂ 2 placing one robber on the vertices of (Formula presented.). After that, starting with PlayerÂ 1, alternately the players may move each of their tokens to the adjacent vertices. PlayerÂ 1 wins if, after a finite number of moves, a cop and the robber end up on the same vertex and PlayerÂ 2 wins otherwise. However, depending on the type of moves the players make, there are three different models, namely, the normal cop model: both cops and robber move along the direction of the arcs; the strong cop model: cops can move along or against the direction of the arcs while the robber moves along them; and the weak cop model: the robber can move along or against the direction of the arcs while the cops move along them. A graph is cop-win if PlayerÂ 1 playing with a single cop has a winning strategy. In this article, we study the three models on some families of oriented graphs and characterize the cop-win directed graphs for the third model.

Original language English Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings Charles J. Colbourn, Roberto Grossi, Nadia Pisanti Springer Verlag 188-200 13 9783030250041 https://doi.org/10.1007/978-3-030-25005-8_16 Published - 1 Jan 2019 Yes 30th International Workshop on Combinatorial Algorithms, IWOCA 2019 - Pisa, ItalyDuration: 23 Jul 2019 → 25 Jul 2019

Publication series

Name Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11638 LNCS 0302-9743 1611-3349

Conference

Conference 30th International Workshop on Combinatorial Algorithms, IWOCA 2019 Italy Pisa 23/07/19 → 25/07/19

ASJC Scopus subject areas

• Theoretical Computer Science
• Computer Science (all)

Fingerprint

Dive into the research topics of 'Cops and robber on some families of oriented graphs'. Together they form a unique fingerprint.