How universal are asymptotics of disconnection times in discrete cylinders? (Q2468420)

For large connected graphs \((G, \mathcal E)\) of uniformly bounded degree, the disconnection time of \(G\times \mathbb Z\) has rough order \(| G| ^2\) for large \(| G| \).