A study of cops and robbers in oriented graphs

by   Devvrit Khatri, et al.

We consider the well-studied cops and robbers game in the context of oriented graphs, which has received surprisingly little attention to date. We examine the relationship between the cop numbers of an oriented graph and its underlying undirected graph, giving a surprising result that there exists at least one graph G for which every strongly connected orientation of G has cop number strictly less than that of G. We also refute a conjecture on the structure of cop-win digraphs, study orientations of outerplanar graphs, and study the cop number of line digraphs. Finally, we consider some the aspects of optimal play, in particular the capture time of cop-win digraphs and properties of the relative positions of the cop(s) and robber.


Cops and robbers on oriented graphs

We consider the well-studied cops and robbers game in the context of ori...

Chromatic Polynomials of Oriented Graphs

The oriented chromatic polynomial of a oriented graph outputs the number...

Oriented coloring on recursively defined digraphs

Coloring is one of the most famous problems in graph theory. The colorin...

Oriented Colourings of Graphs with Maximum Degree Three and Four

We show that any orientation of a graph with maximum degree three has an...

On the inversion number of oriented graphs

Let D be an oriented graph. The inversion of a set X of vertices in D co...

Topological Representation of the Transit Sets of k-Point Crossover Operators

k-point crossover operators and their recombination sets are studied fro...

To reorient is easier than to orient: an on-line algorithm for reorientation of graphs

We define an on-line (incremental) algorithm that, given a (possibly inf...