Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks

In this paper, we mainly study two important properties of weighted Cayley networks depending on a weight factor r. The weight factor makes it more difficult to calculate the topological characteristics such as average weighted shortest path (AWSP) and average receiving time (ART) of the networks. We first calculate some basic network measurements such as average degree and average node strength. Then we derive the expression for AWSP and show that it stays bounded with network order growing (0