On the information transmission delay and algorithms of strong product digraphs

The distance of digraphs is one of the most basic structural parameters in graph theory, and it plays an important role in analyzing the effectiveness of interconnection networks. In particular, it provides a basis for measuring the transmission delay of networks. When the topological structure of an interconnection network is represented by a digraph, the average distance of the directed graph is a good measure of the communication performance of the network. In this paper, we mainly investigate the distance and average distance of strong product digraphs, and using a new way to give a formula for the distance of strong product digraphs, and an algorithm for solving the average distance of strong product digraphs.