The effective resistance of the $N$-cycle graph with four nearest neighbors

Abstract

The exact expression for the effective resistance between any two vertices of the $N$-cycle graph with four nearest neighbors $C_N(1,2)$, is given. It turns out that this expression is written in terms of the effective resistance of the $N$-cycle graph $C_N$, the square of the Fibonacci numbers, and the bisected Fibonacci numbers. As a consequence closed form formulas for the total effective resistance, the first passage time (FPT), and the mean first passage time (MFPT) for the simple random walk on the the $N$-cycle graph with four nearest neighbors are obtained. Finally, a closed form formula for the effective resistance of $C_N(1,2)$ with all first neighbors removed is obtained.

14 pages, 3 figures. Journal of Statistical Physics. Published online: 22 January 2014

Cited by in corpus (1)

• Resistance between two nodes in general position on an $m\times n$ fan network