Two-point resistances in an Apollonian network

被引:9
|
作者
Shangguan, Yingmin [1 ]
Chen, Haiyan [1 ]
机构
[1] Jimei Univ, Sch Sci, Xiamen 361021, Fujian, Peoples R China
基金
中国国家自然科学基金;
关键词
COMPLEX NETWORKS; DISTANCE; GRAPHS;
D O I
10.1103/PhysRevE.96.062140
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
The computation of resistance between two nodes in a resistor network is a classical problem in electric theory and graph theory. Based on the Apollonian packing, Andrade et al. introduced a deterministic growing type of networks A(k) [Phys. Rev. Lett. 94, 018702 (2005)]. In this paper, first, a recursive algorithm for computing resistance between any two nodes in A(k) is given. Then as explanations, using the algorithm, explicit expressions for some resistances in A(k) are obtained.
引用
收藏
页数:7
相关论文
共 50 条