Average distance between the processors of biswapped networks.

Area of Science:

• Graph theory
• Network science
• Computer science

Background:

• Biswapped networks offer efficient node interconnection using transpose-like operations.
• They enhance structural symmetry, contributing to fault tolerance and energy efficiency.
• Biswapped networks are a promising model for robust network design.

Purpose of the Study:

• Investigate node transmission values as a communication cost indicator in biswapped networks.
• Compute the novel distance-based descriptor, the Wiener index.
• Analyze average distances between nodes in biswapped networks derived from various base graphs.

Main Methods:

• Systematic biswapping of edges within base graphs.
• Calculation of node transmission values.
• Computation of the Wiener index and average distances.

Main Results:

• Transmission values were analyzed for biswapped networks from various base graphs.
• The Wiener index was computed using node transmission values.
• Average distances between nodes were investigated.

Conclusions:

• Biswapped networks demonstrate potential for improved network robustness and efficiency.
• The study provides insights into communication costs and distance metrics within these networks.
• Further analysis of biswapped networks can inform future network design.