Cop-edge critical generalized Petersen and Paley graphs

Title

Cop-edge critical generalized Petersen and Paley graphs

Creator

Dominic C.; Witkowski L.; Witkowski M.

Description

Cop Robber game is a two player game played on an undirected graph. In this game, the cops try to capture a robber moving on the vertices of the graph. The cop number of a graph is the least number of cops needed to guarantee that the robber will be caught. We study cop-edge critical graphs, i.e. graphs G such that for any edge e in E(G) either c(G?e) < c(G) or c(G?e) > c(G). In this article, we study the edge criticality of generalized Petersen graphs and Paley graphs. 2023 Azarbaijan Shahid Madani University.

Source

Communications in Combinatorics and Optimization, Vol-8, No. 2, pp. 359-378.

Date

2023-01-01

Publisher

Azarbaijan Shahid Madani University

Subject

Cops and Robbers; Paley graphs; Petersen graphs; vertex-pursuit games

Coverage

Dominic C., Department of Mathematics, CHRIST (Deemed to be university), Karnataka, Bengaluru, 560029, India; Witkowski L., Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Pozna?, Poland; Witkowski M., Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Pozna?, Poland

Rights

Restricted Access

Relation

ISSN: 25382128

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22049/cco.2022.27308.1229

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85148897010&doi=10.22049%2fcco.2022.27308.1229&partnerID=40&md5=d15b050ad5b68f6119a4515f128e212a