activity
20192024
most citedBinary Programming Formulations for the Upper Domination Problem

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

math.CO2021★ 1 cited

Binary Programming Formulations for the Upper Domination Problem

Ryan Burdett, Michael Haythorpe, Alex Newcombe

We consider Upper Domination, the problem of finding the minimal dominating set of maximum cardinality. Very few exact algorithms have been described for solving Upper Domination.…

math.CO2021

Variants of the Domination Number for Flower Snarks

Ryan Burdett, Michael Haythorpe, Alex Newcombe

We consider the flower snarks, a widely studied infinite family of 3--regular graphs. For the Flower snark on vertices, it is trivial to show that the domination number…