On the Lower Bound of Vertex Forwarding Index of Strong Product Graphs

The selection of routing in a network has a direct impact on the effectiveness of the communication system. Good routing selection will not cause blockage or collapse of the communication network due to the damage of a few nodes in the network. The load situation of nodes in a network can be analyzed through their forwarding indices, therefore the vertex forwarding index can be used to evaluate the quality of a routing selection. This article used the strong product method to construct large and complex networks from common small networks. By studying the topological parameters of these networks, we determined a lower bound for the vertex forwarding index of multiple graphs strong product, and obtained the specific lower bounds for the vertex forwarding index of some special strong product graphs.