Complete Characterization of Resistance Distance for Linear Octagonal Networks
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 p...
Saved in:
Main Authors: | Jing Zhao, Jia-Bao Liu, Ali Zafari |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2020/5917098 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Normalized Laplacians, Degree-Kirchhoff Index, and the Complexity of Möbius Graph of Linear Octagonal-Quadrilateral Networks
by: Jia-Bao Liu, et al.
Published: (2021-01-01) -
Octagonal Defects at Carbon Nanotube Junctions
by: W. Jaskólski, et al.
Published: (2013-01-01) -
Further Results on Resistance Distance and Kirchhoff Index in Electric Networks
by: Qun Liu, et al.
Published: (2016-01-01) -
Partition Resolvability of Nanosheet and Nanotube Derived from Octagonal Grid
by: Ali Al Khabyah, et al.
Published: (2024-01-01) -
On Edge H-Irregularity Strength of Hexagonal and Octagonal Grid Graphs
by: Muhammad Ibrahim, et al.
Published: (2022-01-01)