The number of spanning trees in some classes of graphs

DOI10.1216/RMJ-2012-42-4-1183MaRDI QIDQ691272zbMATH OpenFDO

Authors 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)

Recommendations

• Chebyshev polynomials and formulas for a number of spanning trees in circulant graphs
• Chebyshev polynomials and spanning tree formulas
• scientific article; zbMATH DE number 1926055
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• The numbers of spanning trees of some families of circulant graphs

Cites work

• Complexite et circuits euleriens dans les sommes tensorielles de graphes
• Eigenvalues of the Laplacian of a graph^∗
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 2104825 (Why is no real title available?)
• scientific article; zbMATH DE number 2123603 (Why is no real title available?)
• Spanning tree formulas and Chebyshev polynomials
• The number of spanning trees of a complete multipartite graph

Cited in

(30)

• The number of spanning trees of the Cartesian product of regular graphs
• On the number of spanning trees in alternating polycyclic chains
• The number of spanning forests of a graph
• On numbers of vertices of maximum degree in the spanning trees of a graph
• The maximum number of spanning trees of a graph with given matching number
• A limit characterization for the number of spanning trees of graphs
• The number of spanning trees of plane graphs with reflective symmetry
• Counting graphs with different numbers of spanning trees through the counting of prime partitions
• scientific article; zbMATH DE number 6719620 (Why is no real title available?)
• scientific article; zbMATH DE number 2127724 (Why is no real title available?)
• scientific article; zbMATH DE number 5139506 (Why is no real title available?)
• The number of spanning trees in a class of double fixed-step loop networks
• The number of spanning tree in several classes of graphs
• scientific article; zbMATH DE number 3966096 (Why is no real title available?)
• Upper bounds for the number of spanning trees of graphs
• Determinants of grids, tori, cylinders and Möbius ladders
• On the number of spanning trees in random regular graphs
• scientific article; zbMATH DE number 1926055 (Why is no real title available?)
• On the complexity of a class of pyramid graphs and Chebyshev polynomials
• scientific article; zbMATH DE number 2094529 (Why is no real title available?)
• Number of spanning trees in the sequence of some nonahedral graphs
• How many unicycles on a wheel?
• scientific article; zbMATH DE number 5174860 (Why is no real title available?)
• scientific article; zbMATH DE number 5584928 (Why is no real title available?)
• The Existence of an Alternating Sign on a Spanning Tree of Graphs
• scientific article; zbMATH DE number 5497806 (Why is no real title available?)
• The number of spanning trees of a graph with given matching number
• A note on total excess of spanning trees
• The number of spanning trees in self-similar graphs
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs

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

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