A Game of Cops and Robbers in Some Networks.

Date of Submission

December 2020

Date of Award

Winter 12-12-2021

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Das, Sandip (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Cops and Robber games are pursuit-evasion games played on connected graphs. They have been studied extensively and finding the cop number of certain classes of graphs has been one of the major problems in these games. Networks, on the other hand, have been some of the most interesting graph classes. In this work, we will investigate the cop number problem of two types of networks, whose cop numbers were not known in general, namely, butterfly networks and solid grid graphs.


ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28842684

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.



This document is currently not available here.