Complete Characterization of Resistance Distance for Linear Octagonal Networks

المؤلفون المشاركون

Liu, Jia-Bao
Zafari, Ali
Zhao, Jing

المصدر

Complexity

العدد

المجلد 2020، العدد 2020 (31 ديسمبر/كانون الأول 2020)، ص ص. 1-13، 13ص.

الناشر

Hindawi Publishing Corporation

تاريخ النشر

2020-09-15

دولة النشر

مصر

عدد الصفحات

13

التخصصات الرئيسية

الفلسفة

الملخص EN

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.

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

Zhao, Jing& Liu, Jia-Bao& Zafari, Ali. 2020. Complete Characterization of Resistance Distance for Linear Octagonal Networks. Complexity،Vol. 2020, no. 2020, pp.1-13.
https://search.emarefa.net/detail/BIM-1142629

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

Zhao, Jing…[et al.]. Complete Characterization of Resistance Distance for Linear Octagonal Networks. Complexity No. 2020 (2020), pp.1-13.
https://search.emarefa.net/detail/BIM-1142629

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

Zhao, Jing& Liu, Jia-Bao& Zafari, Ali. Complete Characterization of Resistance Distance for Linear Octagonal Networks. Complexity. 2020. Vol. 2020, no. 2020, pp.1-13.
https://search.emarefa.net/detail/BIM-1142629

نوع البيانات

مقالات

لغة النص

الإنجليزية

الملاحظات

Includes bibliographical references

رقم السجل

BIM-1142629