Some links between identifying codes and separating, dominating and total dominating sets in graphs

Autores
Nasini, Graciela Leonor; Torres, Pablo Daniel
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In the search for a dynamic programming-based algorithm derived from the modular decomposition of graphs, we analyze the behavior of the identifying code number under disjoint union and join operations. This study lead us to investigate the behavior of new parameters related to separating, dominating and total dominating sets under the same operations. The obtained results and the modular decomposition of graphs easily result in a dynamic programming-based algorithm to calculate the identifying code number (and the related parameters) of a graph from the parameter values of its modular subgraphs. In particular, we obtain closed formulas for the parameters on spider and quasi-spider graphs which allow us to derive a simple and easy-to-implement linear time algorithm to obtain the identifying code number (and the related parameters) of P4-tidy graphs.
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Torres, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Materia
Identifying Code
Modular Decomposition
P4-Tidy Graph
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/84364
Acceder
id CONICETDig_e5007ad54750f1d55d7c84f2f16fcc4f
oai_identifier_str oai:ri.conicet.gov.ar:11336/84364
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Some links between identifying codes and separating, dominating and total dominating sets in graphsNasini, Graciela LeonorTorres, Pablo DanielIdentifying CodeModular DecompositionP4-Tidy Graphhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1In the search for a dynamic programming-based algorithm derived from the modular decomposition of graphs, we analyze the behavior of the identifying code number under disjoint union and join operations. This study lead us to investigate the behavior of new parameters related to separating, dominating and total dominating sets under the same operations. The obtained results and the modular decomposition of graphs easily result in a dynamic programming-based algorithm to calculate the identifying code number (and the related parameters) of a graph from the parameter values of its modular subgraphs. In particular, we obtain closed formulas for the parameters on spider and quasi-spider graphs which allow us to derive a simple and easy-to-implement linear time algorithm to obtain the identifying code number (and the related parameters) of P4-tidy graphs.Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaFil: Torres, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaElsevier2015-12info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/zipapplication/pdfhttp://hdl.handle.net/11336/84364Nasini, Graciela Leonor; Torres, Pablo Daniel; Some links between identifying codes and separating, dominating and total dominating sets in graphs; Elsevier; Electronic Notes in Discrete Mathematics; 50; 12-2015; 181-1861571-0653CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065315001869info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2015.07.031info: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-09-03T10:06:25Zoai:ri.conicet.gov.ar:11336/84364instacron: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-03 10:06:25.899CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Some links between identifying codes and separating, dominating and total dominating sets in graphs
title Some links between identifying codes and separating, dominating and total dominating sets in graphs
spellingShingle Some links between identifying codes and separating, dominating and total dominating sets in graphs
Nasini, Graciela Leonor
Identifying Code
Modular Decomposition
P4-Tidy Graph
title_short Some links between identifying codes and separating, dominating and total dominating sets in graphs
title_full Some links between identifying codes and separating, dominating and total dominating sets in graphs
title_fullStr Some links between identifying codes and separating, dominating and total dominating sets in graphs
title_full_unstemmed Some links between identifying codes and separating, dominating and total dominating sets in graphs
title_sort Some links between identifying codes and separating, dominating and total dominating sets in graphs
dc.creator.none.fl_str_mv Nasini, Graciela Leonor
Torres, Pablo Daniel
author Nasini, Graciela Leonor
author_facet Nasini, Graciela Leonor
Torres, Pablo Daniel
author_role author
author2 Torres, Pablo Daniel
author2_role author
dc.subject.none.fl_str_mv Identifying Code
Modular Decomposition
P4-Tidy Graph
topic Identifying Code
Modular Decomposition
P4-Tidy Graph
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 the search for a dynamic programming-based algorithm derived from the modular decomposition of graphs, we analyze the behavior of the identifying code number under disjoint union and join operations. This study lead us to investigate the behavior of new parameters related to separating, dominating and total dominating sets under the same operations. The obtained results and the modular decomposition of graphs easily result in a dynamic programming-based algorithm to calculate the identifying code number (and the related parameters) of a graph from the parameter values of its modular subgraphs. In particular, we obtain closed formulas for the parameters on spider and quasi-spider graphs which allow us to derive a simple and easy-to-implement linear time algorithm to obtain the identifying code number (and the related parameters) of P4-tidy graphs.
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Torres, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
description In the search for a dynamic programming-based algorithm derived from the modular decomposition of graphs, we analyze the behavior of the identifying code number under disjoint union and join operations. This study lead us to investigate the behavior of new parameters related to separating, dominating and total dominating sets under the same operations. The obtained results and the modular decomposition of graphs easily result in a dynamic programming-based algorithm to calculate the identifying code number (and the related parameters) of a graph from the parameter values of its modular subgraphs. In particular, we obtain closed formulas for the parameters on spider and quasi-spider graphs which allow us to derive a simple and easy-to-implement linear time algorithm to obtain the identifying code number (and the related parameters) of P4-tidy graphs.
publishDate 2015
dc.date.none.fl_str_mv 2015-12
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/84364
Nasini, Graciela Leonor; Torres, Pablo Daniel; Some links between identifying codes and separating, dominating and total dominating sets in graphs; Elsevier; Electronic Notes in Discrete Mathematics; 50; 12-2015; 181-186
1571-0653
CONICET Digital
CONICET
url http://hdl.handle.net/11336/84364
identifier_str_mv Nasini, Graciela Leonor; Torres, Pablo Daniel; Some links between identifying codes and separating, dominating and total dominating sets in graphs; Elsevier; Electronic Notes in Discrete Mathematics; 50; 12-2015; 181-186
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/url/https://www.sciencedirect.com/science/article/pii/S1571065315001869
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2015.07.031
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/zip
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_ 1842269958345588736
score 12.885934

Publicaciones similares