Spanning trees of extended graphs

DOI10.1007/BF01191204zbMath0776.05032OpenAlexW1977380515MaRDI QIDQ1193532

Alexander K. Kelmans

Publication date: 27 September 1992

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01191204

zbMATH Keywords

volumeextensionmatrix-tree theoremspanning treesPrüfer coding

Mathematics Subject Classification ID

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

Related Items (4)

A blossoming algorithm for tree volumes of composite digraphs ⋮ Generalizations of Abel's and Hurwitz's identities ⋮ The number of spanning trees of a complete multipartite graph ⋮ Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions

Cites Work

• Comparison of graphs by their number of spanning trees
• A certain polynomial of a graph and graphs with an extremal number of trees
• Число Деревьев Графа, Содержащих Заднный Лес

This page was built for publication: Spanning trees of extended graphs