Average distance between the processors of biswapped networks

Biswapped networks provide an efficient way to interconnect nodes through transpose like operations that balance both connectivity and performance. A biswapped network is constructed by systematically biswapping edges within a base graph [Formula: see text], thereby preserving essential connectivity properties while enhancing structural symmetry. This improved symmetry contributes to fault tolerance and energy efficiency, making biswapped networks a promising model for robust network design. In this study, we investigate the sum of distances from a particular node to all others, the transmission of a node in a biswapped network, which is a key indicator of communication cost which helps to compute the novel distance based descriptor Wiener index. Furthermore, we analyze transmission values of biswapped networks derived from various base graphs. Finally, the average distance between the nodes of biswapped networks constructed by various base graphs were investigated.