The number of spanning trees in a superprism

DOI10.47443/DML.2024.004MaRDI QIDQ6561584FDO

Authors Zbigniew R. Bogdanowicz

Publication date 25 June 2024

Published in DML. Discrete Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

circulant graphprism graphenumeration of treesantiprism graphpanning trees

Mathematics Subject Classification ID

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

Recommendations

• A note on the number of spanning trees in a prism graph
• The number of spanning trees in a prism
• Counting spanning trees in prism and anti-prism graphs
• The number of spanning tree in several classes of graphs
• Enumeration of spanning trees in prisms of some graphs

Cites work

• scientific article; zbMATH DE number 3941580 (Why is no real title available?)
• scientific article; zbMATH DE number 3482387 (Why is no real title available?)
• scientific article; zbMATH DE number 3339178 (Why is no real title available?)
• scientific article; zbMATH DE number 3390818 (Why is no real title available?)
• scientific article; zbMATH DE number 2229033 (Why is no real title available?)
• A theorem on trees.
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Graph-Theoretic Concepts in Computer Science
• On the number of rainbow spanning trees in edge-colored complete graphs
• On the number of spanning trees of circulant graphs
• On the number of spanning trees of finite graphs
• On the spanning trees of the hypercube and other products of graphs
• Spanning tree formulas and Chebyshev polynomials
• The number of spanning trees in a prism
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• The number of spanning trees in directed circulant graphs with non-fixed jumps

This page was built for publication: The number of spanning trees in a superprism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561584)