Repositório Institucional da Universidade de Aveiro > CIDMA - Centro de Investigação e Desenvolvimento em Matemática e Aplicações > CIDMA - Artigos >
 A short note on cops and robbers playing on total graphs
Please use this identifier to cite or link to this item http://hdl.handle.net/10773/17065

title: A short note on cops and robbers playing on total graphs
authors: Dominic, Charles
Cardoso, Domingos M.
Witkowski, Lukasz
Witkowski, Marcin
keywords: Cops and robbers
Vertex-pursuit games
issue date: Mar-2017
publisher: International Knoweledge Press
abstract: 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 captured. The total graph T(G) of a graph G has a vertex for each edge and vertex of G and an edge in T(G) for every edge-edge, vertex-edge, and vertex-vertex adjacency in G. In this paper, we play the game on the total graph T(G), showing in particular that c(T(G)) ≤ 3 for every planar graph G.
URI: http://hdl.handle.net/10773/17065
ISSN: 2395-4205
publisher version/DOI: http://www.ikpress.org/abstract/6151
source: Asian Journal of Mathematics and Computer Research
appears in collectionsCIDMA - Artigos

files in this item

file description sizeformat
totalcop.pdfpre-print: approved version246.56 kBAdobe PDFview/open
DominicCardosoLWitkowskiMWitkowski.pdfFinal version562.22 kBAdobe PDFview/open
Restrict Access. You can Request a copy!

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! RCAAP OpenAIRE DeGóis
ria-repositorio@ua.pt - Copyright ©   Universidade de Aveiro - RIA Statistics - Powered by MIT's DSpace software, Version 1.6.2