A note on the number of spanning trees in a prism graph

References

• Abramowitz , M. 1965 . Handbook of Mathematical Functions , Edited by: Stegun , I. A. New York : Dover .
   Google Scholar
• Biggs , N. 1974 . Algebraic Graph Theory , Cambridge University Press .
   Google Scholar
• Boesch , F. T. and Bogdanowicz , Z. R. 1987 . The number of spanning trees in a prism . Internat. J. Comput. Math. , 21 : 229 – 243 .
   Web of Science ®Google Scholar
• Gibson , P. M. 1972 . Solution to problem 5795 . Amer. Math. Monthly , 79 : 914 – 915 .
   Google Scholar
• Göbel , F. and Jagers , A. A. 1979 . On a conjecture of Tutte concerning minimal tree numbers . J. Comb. Theory (B) , 26 : 346 – 348 .
   Google Scholar
• Mayeda , W. 1972 . Graph Theory , New York : Wiley .
   Google Scholar
• Schwenk , A. 1974 . “ Computing the characteristic polynomial of a graph ” . In Graphs and Combinatorics, Lecture Notes in Mathematics 406 , 153 – 172 . Heidelberg : Springer .
   Google Scholar