The number of spanning trees in a prism
Frank T. Boesch, Zbigniew R. Bogdanowicz · International Journal of Computer Mathematics · 1987
Let the vertices of two disjoint, equal length cycles be labelled in one cycle and in the other. The prism Pn is defined as the graph obtained by adding to the disjoint cycles all edges of the form ViWi The prism is sometimes denoted by K 2×Cn . In this work we derive the following simple formula for t(Pn ) the number of spanning trees in .