On the complexity of a class of pyramid graphs and Chebyshev polynomials

DOI10.1155/2013/820549zbMath1299.05172OpenAlexW1983274019WikidataQ59030374 ScholiaQ59030374MaRDI QIDQ474169

S. N. Daoud

Publication date: 24 November 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/820549

Mathematics Subject Classification ID

Graph polynomials (05C31) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Number of spanning trees of different products of complete and complete bipartite graphs ⋮ The complexity of some classes of pyramid graphs created from a gear graph

Cites Work

• Spanning tree formulas and Chebyshev polynomials
• A certain polynomial of a graph and graphs with an extremal number of trees
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• The number of spanning trees in a prism

This page was built for publication: On the complexity of a class of pyramid graphs and Chebyshev polynomials