Sobre convexidade em prismas complementares

• Ano de defesa: 2015
• Autor(a) principal: Duarte, Márcio Antônio
• Orientador(a): Barbosa, Rommel Melgaço
• Banca de defesa: Barbosa, Rommel Melgaço, Yanasse, Horacio Hideki, Oliveira, Carla Silva, Coelho, Erika Morais Martins, Silva, Hebert Coelho da
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• dARK ID: ark:/38995/001300000103f
• Idioma: por
• Instituição de defesa: Universidade Federal de Goiás
• Programa de Pós-Graduação: Programa de Pós-graduação em Ciência da Computação (INF)
• Departamento: Instituto de Informática - INF (RG)
• País: Brasil
• Palavras-chave em Português: Teoria dos grafos; Convexidade; NP-completude; Prismas complementares
• Palavras-chave em Inglês: Graph theory; Convexity; NP-complete; Complementary prisms
• Área do conhecimento CNPq: CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: http://repositorio.bc.ufg.br/tede/handle/tede/4821

In this work, we present some related results, especially the properties algoritimics and of complexity of a product of graphs called complementary prism. Answering some questions left open by Haynes, Slater and van der Merwe, we show that the problem of click, independent set and k-dominant set is NP-Complete for complementary prisms in general. Furthermore, we show NP-completeness results regarding the calculation of some parameters of the P3-convexity for the complementary prism graphs in general, as the P3-geodetic number, P3-hull number and P3-Carathéodory number. We show that the calculation of P3-geodetic number is NP-complete for complementary prism graphs in general. As for the P3-hull number, we can show that the same can be efficiently computed in polynomial time. For the P3-Carathéodory number, we show that it is NPcomplete complementary to prisms bipartite graphs, but for trees, this may be calculated in polynomial time and, for class of cografos, calculating the P3-Carathéodory number of complementary prism of these is 3. We also found a relationship between the cardinality Carathéodory set of a graph and a any Carathéodory set of complementary prism. Finally, we established an upper limit calculation the parameters: geodetic number, hull number and Carathéodory number to operations complementary prism of path, cycles and complete graphs considering the convexities P3 and geodesic.