Explicit formulas for matrices associated to ladder, circular ladder, and Mobius ladder graphs

We give explicit formulas for resistance distance matrices and Moore-Penrose inverses of incidence and Laplacian matrices of ladder, circular ladder, and Möbius ladder graphs. As a result, we compute the Kirchhoff index of these graphs and give new combinatorial formulas for the number of their spanning trees.