The number of spanning trees in some classes of graphs

DOI10.1216/RMJ-2012-42-4-1183zbMath1254.05039MaRDI QIDQ691272

M. H. Shirdareh Haghighi, Khodakhast Bibak

Publication date: 30 November 2012

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.rmjm/1348752081

zbMATH Keywords

Chebyshev polynomialsspanning trees

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Determinants of grids, tori, cylinders and Möbius ladders ⋮ How Many Unicycles on a Wheel? ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ The number of spanning trees of a graph with given matching number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning tree formulas and Chebyshev polynomials
• Complexite et circuits euleriens dans les sommes tensorielles de graphes
• The number of spanning trees of a complete multipartite graph
• Eigenvalues of the Laplacian of a graph^∗

This page was built for publication: The number of spanning trees in some classes of graphs