Square difference labeling and co-secure domination in middle graph of certain graphs
G. Sarmitha, S. Vidyanandini, Soumya Ranjan Nayak · Journal of Discrete Mathematical Sciences and Cryptography · 2024
This paper focus on the dynamic and quickly developing subject of graph Domination study. In this paper, Co-Secure Domination and Square diffrence Labeling for Middle graph of Paths and Regular Spider Graphs has been determined. The findings can be applied on protection strategy for a various communication and interconnection networks, where the routing servers as the network’s vertices and the connection between them as its edges, protecting each node in addition to the guard nodes. This ensures that the guard nodes remain secure as well, and the network as a whole is protected.