Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph
From MaRDI portal
Publication:2202296
DOI10.1007/s10955-020-02569-1zbMath1448.05066OpenAlexW3035390513MaRDI QIDQ2202296
Muhammad Shoaib Sardar, Xiang-Feng Pan, Yun-xiang Li
Publication date: 18 September 2020
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10955-020-02569-1
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)
Related Items (5)
On the resistance diameter of the Cartesian and lexicographic product of paths ⋮ Resistance between two nodes of a ring clique network ⋮ Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron ⋮ On the resistance diameters of graphs and their line graphs ⋮ Some two-vertex resistances of nested triangle network
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resistance distance in complete \(n\)-partite graphs
- Resistance distances and the Kirchhoff index in Cayley graphs
- The unicyclic graphs with maximum degree resistance distance
- On the planarity of Hanoi graphs
- The diameter of Hanoi graphs
- On a question of Leiss regarding the Hanoi Tower problem
- Resistance distance and the normalized Laplacian spectrum
- The number and degree distribution of spanning trees in the Tower of Hanoi graph
- Evaluation of effective resistances in pseudo-distance-regular resistor networks
- Resistance distance in wheels and fans
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
- The worst parallel Hanoi graphs
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- Some two-point resistances of the Sierpinski gasket network
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs
- On the resistance diameter of hypercubes
- Resistance between two nodes of a ring network
- Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index
- Towers of hanoi graphs
- Towers of hanoi problem with arbitraryk≧3 pages
- The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
- Pascal's Triangle and the Tower of Hanoi
This page was built for publication: Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph