A formula for the number of spanning trees of a multi-star related graph

DOI10.1016/S0020-0190(98)00175-6zbMath1339.05192MaRDI QIDQ293471

F. Blanchet-Sadri, M. Dambrine

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001756?np=y

zbMATH Keywords

combinatorial problemsspanning treesmulti-star graph

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (7)

On the number of spanning trees of a multi-complete/star related graph ⋮ A limit characterization for the number of spanning trees of graphs ⋮ Counting spanning trees using modular decomposition ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs ⋮ Unnamed Item ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of spanning trees of multi-star related graphs
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules

This page was built for publication: A formula for the number of spanning trees of a multi-star related graph