3 papers
math.CO2023
The -Graphs of Paths and Cycles
R. C. Brewster, C. M. Mynhardt, L. E. Teshima
The independent domination number of a graph is the minimum cardinality of a maximal independent set of , also called an -set. The -graph of , denoted $\m…
math.CO2023
Reconfiguration of Minimum Independent Dominating Sets in Graphs
R. C. Brewster, C. M. Mynhardt, L. E. Teshima
The independent domination number of a graph is the minimum cardinality of a maximal independent set of , also called an -set. The -graph of , denoted $\m…
math.CO2021
Eternal Domination and Clique Covering
Gary MacGillivray, C. M. Mynhardt, Virgélot Virgile
We study the relationship between the eternal domination number of a graph and its clique covering number using both large-scale computation and analytic methods. In doing so, we a…