5 citations · 11 across the 8 of their papers we have counts for
10 papers · 1 filter
Bounding the Eviction Number of a Graph in Terms of its Independence Number
Gary MacGillivray, Christina Mynhardt, Virgelot Virgile
An eternal dominating family of graph in the eviction game is a collection of dominating sets of such that (a) for a…
Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs
MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann
Given a finite set , a convexity , is a collection of subsets of that contains both the empty set and the set and is closed under intersections. The element…
Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey
C. M. Mynhardt, S. Nasserasr
We survey results concerning reconfigurations of colourings and dominating sets in graphs. The vertices of the -colouring graph of a graph correspond to…
Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs
C. M. Mynhardt, S. E. A. Ogden
A total Roman dominating function on a graph is a function such that every vertex with is adjacent to some vertex with ,…
Total Roman Domination Edge-Critical Graphs
C. Lampman, C. M. Mynhardt, S. E. A. Ogden
A total Roman dominating function on a graph is a function such that every vertex with is adjacent to some vertex with …
On k-Total Dominating Graphs
Saeid Alikhani, Davood Fatehi, Kieka Mynhardt
For a graph G, the k-total dominating graph D_{k}^{t}(G) is the graph whose vertices correspond to the total dominating sets of G that have cardinality at most k; two vertices of D…