Secure Domination in Digraphs

Martin Manrique, Karam Ebadi, Morteza Ebrahimi

Given a graph G = (V,E), a subset S of V is dominating if for every v in V - S there exists u in S such that uv is in E. A dominating subset S of V is secure if for every v in V -…