Asymptotic resistance increment conjecture for block tower graphs
Asymptotic resistance increment conjecture for block tower graphs
Let be the block tower graph , the Cartesian product of the -cycle and the path of length , with vertices, and let be the block tower graph with vertices. Write for the resistance distance between vertices and in . Block tower resistance conjecture.
The conjecture predicts a positive limiting increment in the effective resistance between corresponding extremal vertices of successive block tower graphs. The source presents it as an empirically motivated conjecture and gives no closed formula in general.
Sources & referencesView supporting material
Primary source
E. J. Evans and A. E. Francis, “Algorithmic techniques for finding resistance distances on structured graphs”, arXiv:2108.07942 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.