On the number of spanning trees of multi-star related graphs

DOI10.1016/S0020-0190(98)00008-8zbMath1339.05191OpenAlexW2002378808MaRDI QIDQ293235

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/S0020019098000088?np=y

zbMATH Keywords

combinatorial problemsinterconnection networksspanning treescomplement spanning tree matrix theoremmulti-star graphs

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (10)

A formula for the number of spanning trees of a multi-star related graph ⋮ On the number of spanning trees of a multi-complete/star related graph ⋮ A limit characterization for the number of spanning trees of graphs ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ Counting spanning trees using modular decomposition ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ Counting Spanning Trees in Graphs Using Modular Decomposition ⋮ 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

• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• Uniformly-most reliable networks do not always exist
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of spanning trees of multi-star related graphs