Two-point resistances in an Apollonian network.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 29347284.
- Also identified by DOI 10.1103/PhysRevE.96.062140.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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)PRLTAO0031-900710.1103/PhysRevLett.94.018702]. 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.