  We give explicit formulas for resistance distance matrices and Moore-Penrose
inverses of incidence and Laplacian matrices of ladder, circular ladder, and
M\"{o}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.
