Cops and Robber on Oriented Graphs with Respect to Push Operation

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

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


Graph Searching games are extensively studied in the literature for their vast number of applications in artificial intelligence, robot motion planning, game planning, distributed computing, and graph theory. In particular, Cops and Robber is one of the most well-studied graph searching game, where a set of cops try to capture the position of a single robber. The cop number of a graph is the minimum number of cops required to capture the robber on the graph. In an oriented graph G→, the push operation on a vertex v reverses the orientation of all arcs incident on v. We define and study a variant of the game of Cops and Robber on oriented graphs, where the players also have the ability to push the vertices of the graph.

Original languageEnglish
Title of host publicationAlgorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Proceedings
EditorsAmitabha Bagchi, Rahul Muthu
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages12
ISBN (Print)9783031252105
StatePublished - 1 Jan 2023
Event9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023 - Gandhinagar, India
Duration: 9 Feb 202311 Feb 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13947 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Cops and Robber on Oriented Graphs with Respect to Push Operation'. Together they form a unique fingerprint.

Cite this