Uniform clutters and dominating sets of graphs
Visualitza/Obre
Cita com:
hdl:2117/129817
Tipus de documentArticle
Data publicació2019-06-30
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
ProjecteTECNICAS DE OPTIMIZACION EN TEORIA DE GRAFOS, GRUPOS Y COMBINATORIA. APLICACIONES A REDES, ALGORITMOS Y PROTOCOLOS DE COMUNICACION. (MINECO-MTM2014-60127-P)
GRAFOS Y GEOMETRIA: INTERACCIONES Y APLICACIONES (MINECO-MTM2015-63791-R)
CONNECT - Combinatorics of Networks and Computation (EC-H2020-734922)
GRAFOS Y GEOMETRIA: INTERACCIONES Y APLICACIONES (MINECO-MTM2015-63791-R)
CONNECT - Combinatorics of Networks and Computation (EC-H2020-734922)
Abstract
A (simple) clutter is a family of pairwise incomparable subsets of a finite set . We say that a clutter is a domination clutter if there is at least a graph such that the collection of the inclusion-minimal dominating sets of vertices of is equal to . Given a clutter , we are interested in determining if it is a domination clutter and, if this is not the case, we want to find domination clutters in some sense close to it: the domination completions of . Here we will focus on the family of clutters containing all the subsets with the same cardinality; the uniform clutters of maximum size. Specifically, we characterize those clutters in this family that are domination clutters and, in any other case, we prove that the domination completions exist. Moreover, we then demonstrate that the clutter is uniquely determined by some of its domination completions, in the sense that can be recovered from some of these domination completions by using a suitable operation between clutters.
Descripció
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
CitacióMartí-Farré, J.; Mora, M.; Ruiz, J.L. Uniform clutters and dominating sets of graphs. "Discrete applied mathematics", 30 June 2019, vol. 263, p. 220-233.
ISSN0166-218X
Versió de l'editorhttps://www.sciencedirect.com/science/article/pii/S0166218X18301197
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
marti-mora-ruiz-preprint.pdf | 476,1Kb | Visualitza/Obre |