Enumeration of spanning trees in prisms of some graphs

DOI10.22199/issn.0717-6279-4664zbMath1516.05030OpenAlexW4361024060MaRDI QIDQ6113663

Mohamed R. Zeen El Deen

Publication date: 11 July 2023

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-4664

zbMATH Keywords

complexityChebyshev polynomialsrecurrence relationprism over a graph

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning tree formulas and Chebyshev polynomials
• A certain polynomial of a graph and graphs with an extremal number of trees
• Number of spanning trees of different products of complete and complete bipartite graphs
• Complexity of products of some complete and complete bipartite graphs
• The complexity of some classes of pyramid graphs created from a gear graph
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• The number of spanning trees in a prism
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS

This page was built for publication: Enumeration of spanning trees in prisms of some graphs