3 papers
math.CO2025
Bounds on the propagation radius in power domination
Imran Allie, Brandon du Preez, Dean Reagon +1
Let be a graph and let . It is said that \textit{dominates} . We say that \textit{monitors} vertices of as follows. Initially, all dominated…
math.CO2024
Resistance, oddness and colouring defect of snarks
Imran Allie
Let be a bridgeless cubic graph. The \textit{resistance} of , denoted , is the minimum number of edges which can be removed from in order to render 3-edge-colourab…
math.CO2022
3-critical subgraphs of snarks
Imran Allie
In this paper we further our understanding of the structure of class two cubic graphs, or snarks, as they are commonly known. We do this by investigating their 3-critical subgraphs…