Please use this identifier to cite or link to this item:
|Title:||A short note on cops and robbers playing on total graphs|
Cardoso, Domingos M.
|Keywords:||Cops and robbers|
|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.|
|Appears in Collections:||CIDMA - Artigos|
OGTCG - Artigos
Files in This Item:
|DominicCardosoLWitkowskiMWitkowski.pdf||Final version||562.22 kB||Adobe PDF||View/Open|
|totalcop.pdf||pre-print: approved version||246.56 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.