3 citations · 4 across the 10 of their papers we have counts for
4 papers · 1 filter
Constructing Families of Cospectral Regular Graphs
Michael Haythorpe, Alex Newcombe
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite fami…
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.…
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…
The Secure Domination Number of Cartesian Products of Small Graphs with Paths and Cycles
Michael Haythorpe, Alex Newcombe
The secure domination numbers of the Cartesian products of two small graphs with paths or cycles is determined, as well as for Mobius ladder graphs. Prior to this work, in all case…