Complete Characterization of Resistance Distance for Linear Octagonal Networks

Jing Zhao, Jia-Bao Liu and Ali Zafari

Complexity, 2020, vol. 2020, 1-13

Abstract:

Computing the resistance distance of a network is a fundamental and classical topic. In the aspects of considering the resistances between any two points of the lattice networks, there are many studies associated with the ladder networks and ladderlike networks. But the resistances between any two points for more complex structures than ladder networks or ladderlike networks are still unknown. In this paper, a rather complicated structure which is named linear octagonal network is considered. Treelike octagonal systems are cata-condensed systems of octagons, which represent a class of polycyclic conjugated hydrocarbons. A linear octagonal network is a cata-condensed octagonal system with no branchings. Moreover, the resistances between any two points of a linear octagonal network are first determined. One finds that the effective resistances between new inserted points and others points of a linear octagonal network can be given by the effective resistances between two initial points which are inherited from the linear polyomino network.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/5917098.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/5917098.xml (text/xml)

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:hin:complx:5917098

DOI: 10.1155/2020/5917098

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().