Convexities convexities of paths and geometric

Detalhes bibliográficos
Autor(a) principal: Rafael Teixeira de AraÃjo
Data de Publicação: 2014
Tipo de documento: Dissertação
Idioma: por
Título da fonte: Biblioteca Digital de Teses e Dissertações da UFC
Texto Completo: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104
Resumo: In this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number and the convexity number are NP-hard even for bipartite graphs. Inspired by our research in convexity based on paths, we introduce a new convexity, where we defined as convexity of induced paths of order three or P∗ 3 . We show a relation between the geodetic convexity and the P∗ 3 convexity when the graph is a join of a Km with a non-complete graph. We did research in geometric convexity and from that we characterized graph classes under some convexities such as the star florest in P3 convexity, chordal cographs in P∗ 3 convexity, and the florests in TP convexity. We also demonstrated convexities that are geometric only in specific graph classes such as cographs in P4+-free convexity, F free graphs in F-free convexity and others. Finally, we demonstrated some results of geodesic convexity and P∗ 3 in graphs with few P4âs.
id UFC_dfc4cf61aff2fdc464e951d39b9ad774
oai_identifier_str oai:www.teses.ufc.br:7701
network_acronym_str UFC
network_name_str Biblioteca Digital de Teses e Dissertações da UFC
spelling info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisConvexities convexities of paths and geometricConvexidades de caminhos e convexidades geomÃtricas2014-02-14Rudini Menezes Sampaio25240703876http://lattes.cnpq.br/2845950448235863 Fabricio Siqueira Benevides94456526300http://lattes.cnpq.br/4695081445531168 Mitre Costa Dourado93585896553http://lattes.cnpq.br/0841425239502177Leonardo Sampaio Rocha01778989330 http://lattes.cnpq.br/071667114941470299463199349http://lattes.cnpq.br/5847892628096217Rafael Teixeira de AraÃjoUniversidade Federal do CearÃPrograma de PÃs-GraduaÃÃo em CiÃncia da ComputaÃÃoUFCBRConvexidade em grafos Convexidade geodÃsica NÃmero de Hull NÃmero de convexidade Convexidade geomÃtricaConvexity in graph hull number convexity number P3 convexity geodetic convexity geometric convexityCIENCIA DA COMPUTACAOIn this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number and the convexity number are NP-hard even for bipartite graphs. Inspired by our research in convexity based on paths, we introduce a new convexity, where we defined as convexity of induced paths of order three or P∗ 3 . We show a relation between the geodetic convexity and the P∗ 3 convexity when the graph is a join of a Km with a non-complete graph. We did research in geometric convexity and from that we characterized graph classes under some convexities such as the star florest in P3 convexity, chordal cographs in P∗ 3 convexity, and the florests in TP convexity. We also demonstrated convexities that are geometric only in specific graph classes such as cographs in P4+-free convexity, F free graphs in F-free convexity and others. Finally, we demonstrated some results of geodesic convexity and P∗ 3 in graphs with few P4âs.In this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number and the convexity number are NP-hard even for bipartite graphs. Inspired by our research in convexity based on paths, we introduce a new convexity, where we defined as convexity of induced paths of order three or P∗ 3 . We show a relation between the geodetic convexity and the P∗ 3 convexity when the graph is a join of a Km with a non-complete graph. We did research in geometric convexity and from that we characterized graph classes under some convexities such as the star florest in P3 convexity, chordal cographs in P∗ 3 convexity, and the florests in TP convexity. We also demonstrated convexities that are geometric only in specific graph classes such as cographs in P4+-free convexity, F free graphs in F-free convexity and others. Finally, we demonstrated some results of geodesic convexity and P∗ 3 in graphs with few P4âs.FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgicohttp://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104application/pdfinfo:eu-repo/semantics/openAccessporreponame:Biblioteca Digital de Teses e Dissertações da UFCinstname:Universidade Federal do Cearáinstacron:UFC2019-01-21T11:25:17Zmail@mail.com -
dc.title.en.fl_str_mv Convexities convexities of paths and geometric
dc.title.alternative.pt.fl_str_mv Convexidades de caminhos e convexidades geomÃtricas
title Convexities convexities of paths and geometric
spellingShingle Convexities convexities of paths and geometric
Rafael Teixeira de AraÃjo
Convexidade em grafos
Convexidade geodÃsica
NÃmero de Hull
NÃmero de convexidade
Convexidade geomÃtrica
Convexity in graph
hull number
convexity number
P3 convexity
geodetic convexity
geometric convexity
CIENCIA DA COMPUTACAO
title_short Convexities convexities of paths and geometric
title_full Convexities convexities of paths and geometric
title_fullStr Convexities convexities of paths and geometric
title_full_unstemmed Convexities convexities of paths and geometric
title_sort Convexities convexities of paths and geometric
author Rafael Teixeira de AraÃjo
author_facet Rafael Teixeira de AraÃjo
author_role author
dc.contributor.advisor1.fl_str_mv Rudini Menezes Sampaio
dc.contributor.advisor1ID.fl_str_mv 25240703876
dc.contributor.advisor1Lattes.fl_str_mv http://lattes.cnpq.br/2845950448235863
dc.contributor.referee1.fl_str_mv Fabricio Siqueira Benevides
dc.contributor.referee1ID.fl_str_mv 94456526300
dc.contributor.referee1Lattes.fl_str_mv http://lattes.cnpq.br/4695081445531168
dc.contributor.referee2.fl_str_mv Mitre Costa Dourado
dc.contributor.referee2ID.fl_str_mv 93585896553
dc.contributor.referee2Lattes.fl_str_mv http://lattes.cnpq.br/0841425239502177
dc.contributor.referee3.fl_str_mv Leonardo Sampaio Rocha
dc.contributor.referee3ID.fl_str_mv 01778989330
dc.contributor.referee3Lattes.fl_str_mv http://lattes.cnpq.br/0716671149414702
dc.contributor.authorID.fl_str_mv 99463199349
dc.contributor.authorLattes.fl_str_mv http://lattes.cnpq.br/5847892628096217
dc.contributor.author.fl_str_mv Rafael Teixeira de AraÃjo
contributor_str_mv Rudini Menezes Sampaio
Fabricio Siqueira Benevides
Mitre Costa Dourado
Leonardo Sampaio Rocha
dc.subject.por.fl_str_mv Convexidade em grafos
Convexidade geodÃsica
NÃmero de Hull
NÃmero de convexidade
Convexidade geomÃtrica
topic Convexidade em grafos
Convexidade geodÃsica
NÃmero de Hull
NÃmero de convexidade
Convexidade geomÃtrica
Convexity in graph
hull number
convexity number
P3 convexity
geodetic convexity
geometric convexity
CIENCIA DA COMPUTACAO
dc.subject.eng.fl_str_mv Convexity in graph
hull number
convexity number
P3 convexity
geodetic convexity
geometric convexity
dc.subject.cnpq.fl_str_mv CIENCIA DA COMPUTACAO
dc.description.sponsorship.fl_txt_mv FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico
dc.description.abstract.por.fl_txt_mv In this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number and the convexity number are NP-hard even for bipartite graphs. Inspired by our research in convexity based on paths, we introduce a new convexity, where we defined as convexity of induced paths of order three or P∗ 3 . We show a relation between the geodetic convexity and the P∗ 3 convexity when the graph is a join of a Km with a non-complete graph. We did research in geometric convexity and from that we characterized graph classes under some convexities such as the star florest in P3 convexity, chordal cographs in P∗ 3 convexity, and the florests in TP convexity. We also demonstrated convexities that are geometric only in specific graph classes such as cographs in P4+-free convexity, F free graphs in F-free convexity and others. Finally, we demonstrated some results of geodesic convexity and P∗ 3 in graphs with few P4âs.
dc.description.abstract.eng.fl_txt_mv In this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number and the convexity number are NP-hard even for bipartite graphs. Inspired by our research in convexity based on paths, we introduce a new convexity, where we defined as convexity of induced paths of order three or P∗ 3 . We show a relation between the geodetic convexity and the P∗ 3 convexity when the graph is a join of a Km with a non-complete graph. We did research in geometric convexity and from that we characterized graph classes under some convexities such as the star florest in P3 convexity, chordal cographs in P∗ 3 convexity, and the florests in TP convexity. We also demonstrated convexities that are geometric only in specific graph classes such as cographs in P4+-free convexity, F free graphs in F-free convexity and others. Finally, we demonstrated some results of geodesic convexity and P∗ 3 in graphs with few P4âs.
description In this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number and the convexity number are NP-hard even for bipartite graphs. Inspired by our research in convexity based on paths, we introduce a new convexity, where we defined as convexity of induced paths of order three or P∗ 3 . We show a relation between the geodetic convexity and the P∗ 3 convexity when the graph is a join of a Km with a non-complete graph. We did research in geometric convexity and from that we characterized graph classes under some convexities such as the star florest in P3 convexity, chordal cographs in P∗ 3 convexity, and the florests in TP convexity. We also demonstrated convexities that are geometric only in specific graph classes such as cographs in P4+-free convexity, F free graphs in F-free convexity and others. Finally, we demonstrated some results of geodesic convexity and P∗ 3 in graphs with few P4âs.
publishDate 2014
dc.date.issued.fl_str_mv 2014-02-14
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
status_str publishedVersion
format masterThesis
dc.identifier.uri.fl_str_mv http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104
url http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104
dc.language.iso.fl_str_mv por
language por
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidade Federal do CearÃ
dc.publisher.program.fl_str_mv Programa de PÃs-GraduaÃÃo em CiÃncia da ComputaÃÃo
dc.publisher.initials.fl_str_mv UFC
dc.publisher.country.fl_str_mv BR
publisher.none.fl_str_mv Universidade Federal do CearÃ
dc.source.none.fl_str_mv reponame:Biblioteca Digital de Teses e Dissertações da UFC
instname:Universidade Federal do Ceará
instacron:UFC
reponame_str Biblioteca Digital de Teses e Dissertações da UFC
collection Biblioteca Digital de Teses e Dissertações da UFC
instname_str Universidade Federal do Ceará
instacron_str UFC
institution UFC
repository.name.fl_str_mv -
repository.mail.fl_str_mv mail@mail.com
_version_ 1643295189954985984

Registros relacionados