info:eu-repo/semantics/article
Facets of the polytope of legal sequences
Fecha
2017-11Registro en:
Campêlo, Manoel; Severin, Daniel Esteban; Facets of the polytope of legal sequences; Elsevier; Electronic Notes in Discrete Mathematics; 62; 11-2017; 15-20
1571-0653
CONICET Digital
CONICET
Autor
Campêlo, Manoel
Severin, Daniel Esteban
Resumen
A sequence of vertices in a graph is called a (total) legal dominating sequence if every vertex in the sequence (totally) dominates at least one vertex not dominated by the ones that precedes it, and at the end all vertices of the graph are (totally) dominated. The Grundy (total) domination number of a graph is the size of the largest (total) legal dominating sequence. In this work, we present integer programming formulations for obtaining the Grundy (total) domination number of a graph, we study some aspects of the polyhedral structure of one of them and we test the performance of some new valid inequalities as cuts.