Two-point resistances in a family of self-similar (x,y)-flower networks

Yingmin Shangguan and Haiyan Chen

Physica A: Statistical Mechanics and its Applications, 2019, vol. 523, issue C, 382-391

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.

Keywords: Two-point resistance; Self-similar network; (x,y)-flowers (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037843711930161X
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:523:y:2019:i:c:p:382-391

DOI: 10.1016/j.physa.2019.02.008

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().