Exact vertex forwarding index of the Strong product of complete graph and cycle

Abstract

Effectiveness represents a fundamental performance metric in network communication systems and is intricately tied to the routing made within the network. Since the vertex forwarding index is primarily employed to measure the load-bearing capacity of network nodes, it has become a crucial parameter for evaluating the quality of network routing. By investigating the topological parameters and properties of the Strong product network $K_k\otimes C_c$ and its factor networks (The undirected cycle networks $C_c$ with $c\ge 3$ vertices and the complete networks $K_k$ with $k\ge 2$ vertices), we have determined the exact vertex forwarding index of Strong product graph $K_k\otimes C_c$, which depends solely on the number of vertices in the factor networks.