Complete characterization of resistance distance for linear octagonal networks
From MaRDI portal
Publication:2210270
DOI10.1155/2020/5917098zbMath1451.05219OpenAlexW3086629105MaRDI QIDQ2210270
Jia-Bao Liu, Jing Zhao, Ali Zafari
Publication date: 5 November 2020
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/5917098
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Resistance distance in complete \(n\)-partite graphs
- Effective resistances and Kirchhoff index of ladder graphs
- Resistance distance local rules
- Random walks and the effective resistance sum rules
- Resistance distances in the linear polyomino chain
- Resistance distance and the normalized Laplacian spectrum
- Resistance distance in wheels and fans
- Resistance between two vertices of almost complete bipartite graphs
- Resistance distance in straight linear 2-trees
- Some two-point resistances of the Sierpinski gasket network
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
- Resistance distance in potting networks
- Resistance between two nodes of a ring network
- Resistances between two nodes of a path network
- Resistance distances in composite graphs
- Two-point resistances and random walks on stellated regular graphs
This page was built for publication: Complete characterization of resistance distance for linear octagonal networks
