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

DOI10.1080/00207168808803639zbMath0673.05044OpenAlexW2120051922MaRDI QIDQ3826587

A. A. Jagers

Publication date: 1988

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168808803639

zbMATH Keywords

Chebyshev polynomialscirculantsnumber of spanning treesprism graph

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• On a conjecture of Tutte concerning minimal tree numbers
• The number of spanning trees in a prism

This page was built for publication: A note on the number of spanning trees in a prism graph