Explicit formulas for matrices associated to ladder, circular ladder, and Mobius ladder graphs
Abstract
We give explicit formulas for resistance distance matrices and Moore-Penrose inverses of incidence and Laplacian matrices of ladder, circular ladder, and M\"obius 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.