The number of spanning trees in a prism
From MaRDI portal
Publication:4731198
DOI10.1080/00207168708803568zbMath0682.05029OpenAlexW2064720389MaRDI QIDQ4731198
No author found.
Publication date: 1987
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168708803568
Related Items (14)
The number of rooted forests in circulant graphs ⋮ Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ Spanning tree formulas and Chebyshev polynomials ⋮ Enumeration of spanning trees in prisms of some graphs ⋮ On the Jacobian group of a cone over a circulant graph ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS ⋮ On the complexity of a class of pyramid graphs and Chebyshev polynomials ⋮ A note on the number of spanning trees in a prism graph ⋮ Maximizing the number of spanning trees of networks based on cycle basis representation ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ Maximizing the number of spanning trees of networks based on cycle basis representation ⋮ The neighborhood inclusion structure of a graph
Cites Work
This page was built for publication: The number of spanning trees in a prism
