Cops and robbers on hypergraphs

Abstract

Cops and robbers game is a game usually played on a finite connected graphwith two players, cop and robber. Recently, cops and robbers game played on hypergraphs was introduced. To give a better chance to a cop by allowing morethan one cop and at least one cop has to move, the cop-number, the least numberof cops to guarantee that they win the game, on graphs and hypergraphs is studied.This thesis provides (i) a characterization of a cop-win hypergraph (ii) some results on the products of hypergraphs and (iii) the cop-number of complete k-partite hypergraphs and n-prisms over a hypergraph. Moreover, the cop-number of a special class of graphs is determined.