A Game of Cops and Robbers in Some Networks

Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/7179

Full metadata record

DC Field	Value	Language
dc.contributor.author	Akhtar, Sheikh Shakil	-
dc.date.accessioned	2021-08-03T06:54:59Z	-
dc.date.available	2021-08-03T06:54:59Z	-
dc.date.issued	2020-07	-
dc.identifier.citation	25p.	en_US
dc.identifier.uri	http://hdl.handle.net/10263/7179	-
dc.description	Dissertation under the supervision of Dr. Sandip Das, ACMU	en_US
dc.description.abstract	Cops 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.language.iso	en	en_US
dc.publisher	Indian Statistical Institute, Kolkata	en_US
dc.relation.ispartofseries	Dissertation;;2020-25	-
dc.subject	butterfly networks	en_US
dc.subject	solid grid graphs	en_US
dc.title	A Game of Cops and Robbers in Some Networks	en_US
dc.type	Other	en_US
Appears in Collections:	Dissertations - M Tech (CS)

Files in This Item:

File	Description	Size	Format
SheikhShakilAkhtar_CS1836_MTCSthesis2020.pdf		4.19 MB	Adobe PDF	View/Open