An integer programming approach for solving a generalized version of the Grundy domination number

Manoel Campêlo, Daniel Severín

A sequence of vertices in a graph is called a legal dominating sequence if every vertex in the sequence dominates at least one vertex not dominated by those that precede it, and at…