A secure equitable dominating set S of a graph G is a dominating set in which for any vertex v ∈ V (G) \ S there exists at least one vertex u ∈ S such that u ∈ Ne(v), where Ne(v) indicate the equitable neighbourhood of v, ...