The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations

Autores
Argiroffo, Gabriela Rut; Bianchi, Silvia; Lucarini, Yanina Paola; Wagler, Annegret Katrin
Año de publicación
2019
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
The problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for general graphs. A typical line of attack is therefore to determine the cardinality of minimum such codes in special graphs. In this work we study the change of minimum such codes under three operations in graphs: adding a universal vertex, taking the generalized corona of a graph, and taking the square of a graph. We apply these operations to paths and cycles which allows us to provideminimum codes in most of the resulting graph classes.
Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Bianchi, Silvia. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Lucarini, Yanina Paola. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Wagler, Annegret Katrin. Centre National de la Recherche Scientifique; Francia
10th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019)
Belo Horizonte
Brasil
Coordenação de Aperfeiçoamento de Pessoal de Nivel Superior
Conselho Nacional de Desenvolvimento Científico e Técnologico do Brasil
Universidade Federal de Minas Gerais
Materia
IDENTIFYING CODE
LOCATING-DOMINATING SET
OPEN LOCATING-DOMINATING SET
LOCATING TOTAL-DOMINATING SET
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/129581
Acceder
id CONICETDig_cc918b002a385f06d4cbbc5c17ac079a
oai_identifier_str oai:ri.conicet.gov.ar:11336/129581
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph OperationsArgiroffo, Gabriela RutBianchi, SilviaLucarini, Yanina PaolaWagler, Annegret KatrinIDENTIFYING CODELOCATING-DOMINATING SETOPEN LOCATING-DOMINATING SETLOCATING TOTAL-DOMINATING SEThttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1The problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for general graphs. A typical line of attack is therefore to determine the cardinality of minimum such codes in special graphs. In this work we study the change of minimum such codes under three operations in graphs: adding a universal vertex, taking the generalized corona of a graph, and taking the square of a graph. We apply these operations to paths and cycles which allows us to provideminimum codes in most of the resulting graph classes.Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaFil: Bianchi, Silvia. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaFil: Lucarini, Yanina Paola. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Wagler, Annegret Katrin. Centre National de la Recherche Scientifique; Francia10th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019)Belo HorizonteBrasilCoordenação de Aperfeiçoamento de Pessoal de Nivel SuperiorConselho Nacional de Desenvolvimento Científico e Técnologico do BrasilUniversidade Federal de Minas GeraisElsevier2019info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectSimposioJournalhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/129581The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations; 10th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019); Belo Horizonte; Brasil; 2019; 135-1451571-0661CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571066119300635info:eu-repo/semantics/altIdentifier/doi/10.1016/j.entcs.2019.08.013Internacionalinfo: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-03T09:56:08Zoai:ri.conicet.gov.ar:11336/129581instacron: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 09:56:09.278CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
title The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
spellingShingle The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
Argiroffo, Gabriela Rut
IDENTIFYING CODE
LOCATING-DOMINATING SET
OPEN LOCATING-DOMINATING SET
LOCATING TOTAL-DOMINATING SET
title_short The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
title_full The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
title_fullStr The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
title_full_unstemmed The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
title_sort The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
dc.creator.none.fl_str_mv Argiroffo, Gabriela Rut
Bianchi, Silvia
Lucarini, Yanina Paola
Wagler, Annegret Katrin
author Argiroffo, Gabriela Rut
author_facet Argiroffo, Gabriela Rut
Bianchi, Silvia
Lucarini, Yanina Paola
Wagler, Annegret Katrin
author_role author
author2 Bianchi, Silvia
Lucarini, Yanina Paola
Wagler, Annegret Katrin
author2_role author
author
author
dc.subject.none.fl_str_mv IDENTIFYING CODE
LOCATING-DOMINATING SET
OPEN LOCATING-DOMINATING SET
LOCATING TOTAL-DOMINATING SET
topic IDENTIFYING CODE
LOCATING-DOMINATING SET
OPEN LOCATING-DOMINATING SET
LOCATING TOTAL-DOMINATING SET
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for general graphs. A typical line of attack is therefore to determine the cardinality of minimum such codes in special graphs. In this work we study the change of minimum such codes under three operations in graphs: adding a universal vertex, taking the generalized corona of a graph, and taking the square of a graph. We apply these operations to paths and cycles which allows us to provideminimum codes in most of the resulting graph classes.
Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Bianchi, Silvia. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Lucarini, Yanina Paola. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Wagler, Annegret Katrin. Centre National de la Recherche Scientifique; Francia
10th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019)
Belo Horizonte
Brasil
Coordenação de Aperfeiçoamento de Pessoal de Nivel Superior
Conselho Nacional de Desenvolvimento Científico e Técnologico do Brasil
Universidade Federal de Minas Gerais
description The problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for general graphs. A typical line of attack is therefore to determine the cardinality of minimum such codes in special graphs. In this work we study the change of minimum such codes under three operations in graphs: adding a universal vertex, taking the generalized corona of a graph, and taking the square of a graph. We apply these operations to paths and cycles which allows us to provideminimum codes in most of the resulting graph classes.
publishDate 2019
dc.date.none.fl_str_mv 2019
dc.type.none.fl_str_mv info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/conferenceObject
Simposio
Journal
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
status_str publishedVersion
format conferenceObject
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/129581
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations; 10th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019); Belo Horizonte; Brasil; 2019; 135-145
1571-0661
CONICET Digital
CONICET
url http://hdl.handle.net/11336/129581
identifier_str_mv The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations; 10th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019); Belo Horizonte; Brasil; 2019; 135-145
1571-0661
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/S1571066119300635
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.entcs.2019.08.013
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
application/pdf
dc.coverage.none.fl_str_mv Internacional
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_ 1842269387382325248
score 13.13397

Publicaciones similares