TY: JOUR
T1 - A short note on cops and robbers playing on total graphs
A1 - Dominic, Charles
A1 - Cardoso, Domingos M.
A1 - Witkowski, Lukasz
A1 - Witkowski, Marcin
N2 - 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.
UR - https://ria.ua.pt/handle/10773/17065
Y1 - 2017
PB - International Knoweledge Press