This paper focuses on the dynamic and quickly developing subject of graph domination and labeling study. In this paper, co-secure domination and square difference labeling for middle graph of cycle and complete binary tree graphs has been determined. The findings can be utilized in developing a security strategy for various communication and interconnection networks. The routing servers serve as the network’s vertices, and the connections between them act as the network’s edges. This technique protects each node in addition to the guard nodes. Consequently, this guarantees that the guard nodes will continue to be safe, and that the network as a whole will get protection.