Buscar
Mostrando ítems 1-1 de 1
Valid inequalities and complete characterizations of the 2-domination and P3-hull number polytope
(Universidad Torcuato Di Tella, 2023)
Given a graph G = (V;E), a subset S V is 2-dominating if every vertex in S
has at least two neighbors in S. The minimum cardinality of such a set is called
the 2-domination number of G. Consider a process in discrete ...