A variation of Cops and Robbers on Graphs

Simple item record
dc.contributor.authorRimal, Bijay
dc.contributor.authorLerch, Rachael
dc.contributor.authorShannon, Jack
dc.date.accessioned2021-10-27T14:32:03Z
dc.date.available2021-10-27T14:32:03Z
dc.date.created2020
dc.description2020 Celebration of Student Research and Creativity presentationen_US
dc.description.abstract"We consider a variation of game of cops and robber where the cop seeks to determine the location of the robber by selecting a vertex v in the graph and receiving distance from v to the invisible robber. The movement of robber is restricted to adjacent vertices except for the vertices just probed by the cop. We use multiple probes per turn for the cop to determine strategies to locate the robber in the Gr otzsch graph, the Petersen graph, and split graphs and conclude that it takes at most 3 turns to locate the robber in Gr otzsch graph and the Petersen graph. We also provide strategies to locate robber on different split graphs"en_US
dc.description.urihttps://youtu.be/ZxEjlkUYA2sen_US
dc.identifier.urihttp://hdl.handle.net/11216/4082
dc.language.isoen_USen_US
dc.publisherNorthern Kentucky Universityen_US
dc.relation.ispartofseriesCelebration of Student Research and Creativity;2020
dc.subjectGraphic methodsen_US
dc.subjectGamesen_US
dc.titleA variation of Cops and Robbers on Graphsen_US
dc.typePresentationen_US

Files

Collections

Student Research and Creativity