Abstract
The computation of resistance between two nodes in networks is a fundamental problem in both electric theory and graph theory. In this paper, first, a recursive algorithm for computing resistance between any two nodes in a family of self-similar (x,y)-flower networks is given. The (x,y)-flower networks display rich behavior as observed in a large variety of real systems. Then as explanations, using the algorithm, explicit expressions for some resistances in (1,3)-flower networks and (2,2)-flower networks are obtained.
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.
