On the number of spanning trees of a multi-complete/star related graph

DOI10.1016/S0020-0190(00)00135-6zbMath1339.05189MaRDI QIDQ294864

F. Blanchet-Sadri, M. Dambrine

Publication date: 16 June 2016

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

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

zbMATH Keywords

combinatorial problemscountingmaximizationspanning trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (6)

The number of spanning trees in a new lexicographic product of graphs ⋮ On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs ⋮ A limit characterization for the number of spanning trees of graphs ⋮ The number of spanning trees in the composition graphs ⋮ Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs ⋮ Unnamed Item

Cites Work

• On the number of spanning trees of multi-star related graphs
• A formula for the number of spanning trees of a multi-star related graph
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of spanning trees of a multi-complete/star related graph