Abstract
The resistance distance among two vertices in some resistor networks has been widely considered by many physicists and mathematicians. The resistance diameter of a graph is defined by the maximum resistance distance among all pairs of vertices in the graph. The study of resistance diameter was initiated here. It seems to be possible that the resistance diameter of a graph could play a significant role in analyzing the efficiency of the interconnection networks for wave- or fluid-like communication. In order to improve the efficiency of wave- or fluid-like communication, we need to minimize the resistance diameter of graphs. The class of hypercubes is the most common, multipurpose and efficient topological structure class of interconnection networks. Hypercube networks satisfy most requirements for the basic principles of network design. The main result of this paper is to give a combinatorial formula for the resistance diameter of hypercubes. In addition, the minimum resistance distance among all pairs of vertices in hypercubes is also obtained. These two results are deduced via the electrical network approach and the hitting time of random walks, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
