{k}-domination for chordal graphs and related graph classes

Autores
Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel
Año de publicación
2013
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this work we obtain a new graph class where the {. k}-dominating function problem ({. k}-DOM) is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solvable. Firstly, by relating this problem with the k-dominating function problem (k-DOM), we prove that {. k}-DOM is polynomial time solvable for strongly chordal graphs. Besides, by expressing the property involved in k-DOM in Counting Monadic Second-order Logic, we obtain that both problems are linear time solvable for bounded tree-width graphs. Finally, we show that {. k}-DOM is linear time solvable for spider graphs.
Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Torres, Pablo Daniel. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Materia
CHORDAL GRAPH
COMPUTATIONAL COMPLEXITY
K-DOMINATING FUNCTION
{K}-DOMINATING FUNCTION
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/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/94349
Acceder
id CONICETDig_f716669ab312964e8bd1dbde79e92b8c
oai_identifier_str oai:ri.conicet.gov.ar:11336/94349
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling {k}-domination for chordal graphs and related graph classesArgiroffo, Gabriela RutLeoni, Valeria AlejandraTorres, Pablo DanielCHORDAL GRAPHCOMPUTATIONAL COMPLEXITYK-DOMINATING FUNCTION{K}-DOMINATING FUNCTIONhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1In this work we obtain a new graph class where the {. k}-dominating function problem ({. k}-DOM) is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solvable. Firstly, by relating this problem with the k-dominating function problem (k-DOM), we prove that {. k}-DOM is polynomial time solvable for strongly chordal graphs. Besides, by expressing the property involved in k-DOM in Counting Monadic Second-order Logic, we obtain that both problems are linear time solvable for bounded tree-width graphs. Finally, we show that {. k}-DOM is linear time solvable for spider graphs.Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaFil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; ArgentinaFil: Torres, Pablo Daniel. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; ArgentinaElsevier2013-11info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/94349Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel; {k}-domination for chordal graphs and related graph classes; Elsevier; Electronic Notes in Discrete Mathematics; 44; 11-2013; 219-2241571-0653CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2013.10.034info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065313002503info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-29T11:11:56Zoai:ri.conicet.gov.ar:11336/94349instacron: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-10-29 11:11:56.785CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv {k}-domination for chordal graphs and related graph classes
title {k}-domination for chordal graphs and related graph classes
spellingShingle {k}-domination for chordal graphs and related graph classes
Argiroffo, Gabriela Rut
CHORDAL GRAPH
COMPUTATIONAL COMPLEXITY
K-DOMINATING FUNCTION
{K}-DOMINATING FUNCTION
title_short {k}-domination for chordal graphs and related graph classes
title_full {k}-domination for chordal graphs and related graph classes
title_fullStr {k}-domination for chordal graphs and related graph classes
title_full_unstemmed {k}-domination for chordal graphs and related graph classes
title_sort {k}-domination for chordal graphs and related graph classes
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 GRAPH
COMPUTATIONAL COMPLEXITY
K-DOMINATING FUNCTION
{K}-DOMINATING FUNCTION
topic CHORDAL GRAPH
COMPUTATIONAL COMPLEXITY
K-DOMINATING FUNCTION
{K}-DOMINATING FUNCTION
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In this work we obtain a new graph class where the {. k}-dominating function problem ({. k}-DOM) is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solvable. Firstly, by relating this problem with the k-dominating function problem (k-DOM), we prove that {. k}-DOM is polynomial time solvable for strongly chordal graphs. Besides, by expressing the property involved in k-DOM in Counting Monadic Second-order Logic, we obtain that both problems are linear time solvable for bounded tree-width graphs. Finally, we show that {. k}-DOM is linear time solvable for spider graphs.
Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Torres, Pablo Daniel. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
description In this work we obtain a new graph class where the {. k}-dominating function problem ({. k}-DOM) is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solvable. Firstly, by relating this problem with the k-dominating function problem (k-DOM), we prove that {. k}-DOM is polynomial time solvable for strongly chordal graphs. Besides, by expressing the property involved in k-DOM in Counting Monadic Second-order Logic, we obtain that both problems are linear time solvable for bounded tree-width graphs. Finally, we show that {. k}-DOM is linear time solvable for spider graphs.
publishDate 2013
dc.date.none.fl_str_mv 2013-11
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/94349
Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel; {k}-domination for chordal graphs and related graph classes; Elsevier; Electronic Notes in Discrete Mathematics; 44; 11-2013; 219-224
1571-0653
CONICET Digital
CONICET
url http://hdl.handle.net/11336/94349
identifier_str_mv Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel; {k}-domination for chordal graphs and related graph classes; Elsevier; Electronic Notes in Discrete Mathematics; 44; 11-2013; 219-224
1571-0653
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.endm.2013.10.034
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065313002503
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
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_ 1847425972487323648
score 13.10058

Publicaciones similares