Chebyshev polynomials and spanning tree formulas

MaRDI QIDQ4913062zbMATH OpenFDO

Authors S. N. Daoud

Publication date 3 April 2013

zbMATH Keywords

Chebyshev polynomialsKirchhoff matrixnumber of spanning trees

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

Recommendations

• Chebyshev polynomials and formulas for a number of spanning trees in circulant graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Spanning tree formulas and Chebyshev polynomials
• scientific article; zbMATH DE number 1984566
• On the number of spanning trees in alternating polycyclic chains

Cited in

(10)

• Spanning tree formulas and Chebyshev polynomials
• Number of spanning trees of different products of complete and complete bipartite graphs
• On the number of spanning trees in alternating polycyclic chains
• The complexity of some classes of pyramid graphs created from a gear graph
• Complexity of trapezoidal graphs with different triangulations
• Chebyshev polynomials and formulas for a number of spanning trees in circulant graphs
• scientific article; zbMATH DE number 1984566 (Why is no real title available?)
• On the complexity of a class of pyramid graphs and Chebyshev polynomials
• The number of spanning trees in some classes of graphs
• Calculating the entropy and number of spanning trees of a complex network model

This page was built for publication: Chebyshev polynomials and spanning tree formulas

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