On the number of spanning trees of finite graphs

DOI10.21136/cpm.1969.117654zbMath0175.20902OpenAlexW3048181327MaRDI QIDQ5563934

J.Sedláček

Publication date: 1969

Full work available at URL: https://eudml.org/doc/21020

zbMATH Keywords

topology

Related Items (8)

Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ Weighted complexities of graph products and bundles ⋮ The quadratic minimum spanning tree problem and its variations ⋮ On the Jacobian group of a cone over a circulant graph ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ The number of quasi-trees in fans and wheels ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ Forest decompositions of ladders

This page was built for publication: On the number of spanning trees of finite graphs