A short note on cops and robbers playing on total graphs

Detalhes bibliográficos
Autor(a) principal: Dominic, Charles
Data de Publicação: 2017
Outros Autores: Cardoso, Domingos M., Witkowski, Lukasz, Witkowski, Marcin
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10773/17065
Resumo: 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.
id RCAP_6f30584ac14ba56c0b733362e3191664
oai_identifier_str oai:ria.ua.pt:10773/17065
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A short note on cops and robbers playing on total graphsCops and robbersVertex-pursuit gamesCop 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.International Knoweledge Press2017-032017-03-01T00:00:00Z2019-02-23T12:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/pdfhttp://hdl.handle.net/10773/17065eng2395-4205Dominic, CharlesCardoso, Domingos M.Witkowski, LukaszWitkowski, Marcininfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-05-06T04:00:32Zoai:ria.ua.pt:10773/17065Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-05-06T04:00:32Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A short note on cops and robbers playing on total graphs
title A short note on cops and robbers playing on total graphs
spellingShingle A short note on cops and robbers playing on total graphs
Dominic, Charles
Cops and robbers
Vertex-pursuit games
title_short A short note on cops and robbers playing on total graphs
title_full A short note on cops and robbers playing on total graphs
title_fullStr A short note on cops and robbers playing on total graphs
title_full_unstemmed A short note on cops and robbers playing on total graphs
title_sort A short note on cops and robbers playing on total graphs
author Dominic, Charles
author_facet Dominic, Charles
Cardoso, Domingos M.
Witkowski, Lukasz
Witkowski, Marcin
author_role author
author2 Cardoso, Domingos M.
Witkowski, Lukasz
Witkowski, Marcin
author2_role author
author
author
dc.contributor.author.fl_str_mv Dominic, Charles
Cardoso, Domingos M.
Witkowski, Lukasz
Witkowski, Marcin
dc.subject.por.fl_str_mv Cops and robbers
Vertex-pursuit games
topic Cops and robbers
Vertex-pursuit games
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 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.
publishDate 2017
dc.date.none.fl_str_mv 2017-03
2017-03-01T00:00:00Z
2019-02-23T12:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10773/17065
url http://hdl.handle.net/10773/17065
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 2395-4205
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv International Knoweledge Press
publisher.none.fl_str_mv International Knoweledge Press
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv mluisa.alvim@gmail.com
_version_ 1817543578841251840

Registros relacionados