Secure Domination in Digraphs
Combinatorics
2015-03-16 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1503.04048,
title = {Secure Domination in Digraphs},
author = {Martin Manrique and Karam Ebadi and Morteza Ebrahimi},
journal= {arXiv preprint arXiv:1503.04048},
year = {2015}
}
Comments
14 pages, 1 figure