Asymptotic resistance increment conjecture for block tower graphs

Let GG be the block tower graph C4PnC_4\square P_n, the Cartesian product of the 44-cycle and the path of length nn, with 4n4n vertices, and let HH be the block tower graph C4Pn+1C_4\square P_{n+1} with 4n+44n+4 vertices. Write rG(u,v)r_G(u,v) for the resistance distance between vertices uu and vv in GG. Block tower resistance conjecture.

limn(rH(1,4n+3)rG(1,4n1))=14.\lim_{n\rightarrow \infty} \bigl(r_H(1,4n+3)-r_G(1,4n-1)\bigr)=\frac{1}{4}.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.