The number of spanning trees in a superprism

DOI10.47443/DML.2024.004MaRDI QIDQ6561584FDOQ6561584

Authors: Zbigniew R. Bogdanowicz 

Publication date: 25 June 2024

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

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

zbMATH Keywords

circulant graphprism graphenumeration of treesantiprism graphpanning trees

Mathematics Subject Classification ID

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

Cites Work

• Spanning tree formulas and Chebyshev polynomials
• Title not available (Why is that?)
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the spanning trees of the hypercube and other products of graphs
• On the number of rainbow spanning trees in edge-colored complete graphs
• The number of spanning trees in a prism
• On the number of spanning trees of circulant graphs
• The number of spanning trees in directed circulant graphs with non-fixed jumps
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of spanning trees of finite graphs
• Graph-Theoretic Concepts in Computer Science
• A theorem on trees.
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic

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)