On the complexity of { k } -domination and k-tuple domination in graphs

Autores
Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We consider two types of graph domination - {k}-domination and k-tuple domination, for a fixed positive integer k - and provide new NP-complete as well as polynomial time solvable instances for their related decision problems. Regarding NP-completeness results, we solve the complexity of the {k}-domination problem on split graphs, chordal bipartite graphs and planar graphs, left open in 2008. On the other hand, by exploiting Courcelle's results on Monadic Second Order Logic, we obtain that both problems are polynomial time solvable for graphs with clique-width bounded by a constant. In addition, we give an alternative proof for the linearity of these problems on strongly chordal graphs.
Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario; Argentina
Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Torres, Pablo Daniel. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
Chordal Graphs
Computational Complexity
K-Tuple Domination
Planar Graphs
Split Graphs
{ K } Domination
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/49955
Acceder
id CONICETDig_130de96dcc30a37b0f096b31a6f0bd58
oai_identifier_str oai:ri.conicet.gov.ar:11336/49955
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling On the complexity of { k } -domination and k-tuple domination in graphsArgiroffo, Gabriela RutLeoni, Valeria AlejandraTorres, Pablo DanielChordal GraphsComputational ComplexityK-Tuple DominationPlanar GraphsSplit Graphs{ K } Dominationhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1We consider two types of graph domination - {k}-domination and k-tuple domination, for a fixed positive integer k - and provide new NP-complete as well as polynomial time solvable instances for their related decision problems. Regarding NP-completeness results, we solve the complexity of the {k}-domination problem on split graphs, chordal bipartite graphs and planar graphs, left open in 2008. On the other hand, by exploiting Courcelle's results on Monadic Second Order Logic, we obtain that both problems are polynomial time solvable for graphs with clique-width bounded by a constant. In addition, we give an alternative proof for the linearity of these problems on strongly chordal graphs.Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario; ArgentinaFil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Torres, Pablo Daniel. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaElsevier Science2015-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/49955Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel; On the complexity of { k } -domination and k-tuple domination in graphs; Elsevier Science; Information Processing Letters; 115; 6-8; 6-2015; 556-5610020-0190CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.ipl.2015.01.007info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0020019015000162info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:52:15Zoai:ri.conicet.gov.ar:11336/49955instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 09:52:15.736CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv On the complexity of { k } -domination and k-tuple domination in graphs
title On the complexity of { k } -domination and k-tuple domination in graphs
spellingShingle On the complexity of { k } -domination and k-tuple domination in graphs
Argiroffo, Gabriela Rut
Chordal Graphs
Computational Complexity
K-Tuple Domination
Planar Graphs
Split Graphs
{ K } Domination
title_short On the complexity of { k } -domination and k-tuple domination in graphs
title_full On the complexity of { k } -domination and k-tuple domination in graphs
title_fullStr On the complexity of { k } -domination and k-tuple domination in graphs
title_full_unstemmed On the complexity of { k } -domination and k-tuple domination in graphs
title_sort On the complexity of { k } -domination and k-tuple domination in graphs
dc.creator.none.fl_str_mv Argiroffo, Gabriela Rut
Leoni, Valeria Alejandra
Torres, Pablo Daniel
author Argiroffo, Gabriela Rut
author_facet Argiroffo, Gabriela Rut
Leoni, Valeria Alejandra
Torres, Pablo Daniel
author_role author
author2 Leoni, Valeria Alejandra
Torres, Pablo Daniel
author2_role author
author
dc.subject.none.fl_str_mv Chordal Graphs
Computational Complexity
K-Tuple Domination
Planar Graphs
Split Graphs
{ K } Domination
topic Chordal Graphs
Computational Complexity
K-Tuple Domination
Planar Graphs
Split Graphs
{ K } Domination
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We consider two types of graph domination - {k}-domination and k-tuple domination, for a fixed positive integer k - and provide new NP-complete as well as polynomial time solvable instances for their related decision problems. Regarding NP-completeness results, we solve the complexity of the {k}-domination problem on split graphs, chordal bipartite graphs and planar graphs, left open in 2008. On the other hand, by exploiting Courcelle's results on Monadic Second Order Logic, we obtain that both problems are polynomial time solvable for graphs with clique-width bounded by a constant. In addition, we give an alternative proof for the linearity of these problems on strongly chordal graphs.
Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario; Argentina
Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Torres, Pablo Daniel. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description We consider two types of graph domination - {k}-domination and k-tuple domination, for a fixed positive integer k - and provide new NP-complete as well as polynomial time solvable instances for their related decision problems. Regarding NP-completeness results, we solve the complexity of the {k}-domination problem on split graphs, chordal bipartite graphs and planar graphs, left open in 2008. On the other hand, by exploiting Courcelle's results on Monadic Second Order Logic, we obtain that both problems are polynomial time solvable for graphs with clique-width bounded by a constant. In addition, we give an alternative proof for the linearity of these problems on strongly chordal graphs.
publishDate 2015
dc.date.none.fl_str_mv 2015-06
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/49955
Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel; On the complexity of { k } -domination and k-tuple domination in graphs; Elsevier Science; Information Processing Letters; 115; 6-8; 6-2015; 556-561
0020-0190
CONICET Digital
CONICET
url http://hdl.handle.net/11336/49955
identifier_str_mv Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel; On the complexity of { k } -domination and k-tuple domination in graphs; Elsevier Science; Information Processing Letters; 115; 6-8; 6-2015; 556-561
0020-0190
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ipl.2015.01.007
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0020019015000162
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1844613603699720192
score 13.070432

Publicaciones similares