A Game of Cops and Robbers in Some Networks

dc.contributor.authorAkhtar, Sheikh Shakil
dc.date.accessioned2021-08-03T06:54:59Z
dc.date.available2021-08-03T06:54:59Z
dc.date.issued2020-07
dc.descriptionDissertation under the supervision of Dr. Sandip Das, ACMUen_US
dc.description.abstractCops and Robber games are pursuit-evasion games played on connected graphs. They have been studied extensively and nding 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 interest- ing 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.en_US
dc.identifier.citation25p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/7179
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;;2020-25
dc.subjectbutterfly networksen_US
dc.subjectsolid grid graphsen_US
dc.titleA Game of Cops and Robbers in Some Networksen_US
dc.typeOtheren_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
SheikhShakilAkhtar_CS1836_MTCSthesis2020.pdf
Size:
4.09 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: