2015/03/13 by Martin Manrique, Manrique, Martin, Karam Ebadi +3
Mathematics · #05C20 #05C69 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C20 #msc:05C69
paper · pdf · doi:10.48550/arxiv.1503.04048
14 pages, 1 figure
arxiv created 2015/03/13 · arxiv updated 2015/03/16
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 - S there exists u in S such that (S - u) U v is dominating. In this work we extend the concept of secure dominating set to digraphs in four different ways, all of them with interesting applications, and prove some results regarding each of them.