Abstract
This paper focuses on the fascinating and highly active area of research on domination in graphs. In this article, the secure domination problem in graph theory is solved for Benes networks. The results obtained can be used in finding minimum secure dominating sets for an interconnection network whose vertices are the routing servers while it becomes necessary to obtain an optimal solution for designing the network defence strategy.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.