New facets of the 2-dominating set polytope of trees

Autores
Argiroffo, Gabriela
Año de publicación
2013
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Given a graph G and a nonnegative integer number k, a k- dominating set in G is a subset of vertices D such that every vertex in the graph is adjacent to at least k elements of D. The k-dominating set polytope is the convex hull of the incidence vectors of k-dominating sets in G. This is a natural generalization of the well-known dominating set polytope in graphs. In this work we study the 2-dominating set polytope of trees and we will provide new facet de ning inequalities for it.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
2-domination
Facet
Tree
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/94585
Acceder
id SEDICI_1a4d204b670b9ee2118c2fe4a3398696
oai_identifier_str oai:sedici.unlp.edu.ar:10915/94585
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling New facets of the 2-dominating set polytope of treesArgiroffo, GabrielaCiencias Informáticas2-dominationFacetTreeGiven a graph G and a nonnegative integer number k, a k- dominating set in G is a subset of vertices D such that every vertex in the graph is adjacent to at least k elements of D. The k-dominating set polytope is the convex hull of the incidence vectors of k-dominating sets in G. This is a natural generalization of the well-known dominating set polytope in graphs. In this work we study the 2-dominating set polytope of trees and we will provide new facet de ning inequalities for it.Sociedad Argentina de Informática e Investigación Operativa2013-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf30-34http://sedici.unlp.edu.ar/handle/10915/94585enginfo:eu-repo/semantics/altIdentifier/issn/1850-2865info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-11-05T12:59:03Zoai:sedici.unlp.edu.ar:10915/94585Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-11-05 12:59:03.644SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv New facets of the 2-dominating set polytope of trees
title New facets of the 2-dominating set polytope of trees
spellingShingle New facets of the 2-dominating set polytope of trees
Argiroffo, Gabriela
Ciencias Informáticas
2-domination
Facet
Tree
title_short New facets of the 2-dominating set polytope of trees
title_full New facets of the 2-dominating set polytope of trees
title_fullStr New facets of the 2-dominating set polytope of trees
title_full_unstemmed New facets of the 2-dominating set polytope of trees
title_sort New facets of the 2-dominating set polytope of trees
dc.creator.none.fl_str_mv Argiroffo, Gabriela
author Argiroffo, Gabriela
author_facet Argiroffo, Gabriela
author_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
2-domination
Facet
Tree
topic Ciencias Informáticas
2-domination
Facet
Tree
dc.description.none.fl_txt_mv Given a graph G and a nonnegative integer number k, a k- dominating set in G is a subset of vertices D such that every vertex in the graph is adjacent to at least k elements of D. The k-dominating set polytope is the convex hull of the incidence vectors of k-dominating sets in G. This is a natural generalization of the well-known dominating set polytope in graphs. In this work we study the 2-dominating set polytope of trees and we will provide new facet de ning inequalities for it.
Sociedad Argentina de Informática e Investigación Operativa
description Given a graph G and a nonnegative integer number k, a k- dominating set in G is a subset of vertices D such that every vertex in the graph is adjacent to at least k elements of D. The k-dominating set polytope is the convex hull of the incidence vectors of k-dominating sets in G. This is a natural generalization of the well-known dominating set polytope in graphs. In this work we study the 2-dominating set polytope of trees and we will provide new facet de ning inequalities for it.
publishDate 2013
dc.date.none.fl_str_mv 2013-09
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/94585
url http://sedici.unlp.edu.ar/handle/10915/94585
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1850-2865
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
30-34
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1847978633329639424
score 13.087074

Publicaciones similares