Author:
Angel D,Mary Jeya Jothi R,Revathi R,Raja A.
Abstract
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.
Subject
General Physics and Astronomy
Reference10 articles.
1. Secure domination in proper interval graphs;Araki,2018
2. Multicomputers: Message-Passing Concurrent Computers;Athas;IEEE Computer,1988
3. Secure domination In the joins of graphs;Castillano Elmer,2014
4. Protection of a Graph;Cockayne;Utilitas Mathematica,2005
5. Graph theory;Harary,1993
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On 2-Domination in Hexagonal Networks;2022 First International Conference on Electrical, Electronics, Information and Communication Technologies (ICEEICT);2022-02-16