scientific article; zbMATH DE number 3390818

zbMath0247.05142MaRDI QIDQ5659582

J.Sedláček

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items

The number of rooted forests in circulant graphs, Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics, The number of spanning trees of the generalized Boolean \(n\)-cube network, 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, Spanning forests and the golden ratio, Path intersection matrices and applications to networks, The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic, The number of spanning trees of the generalized hypercube network, From Goeritz Matrices to Quasi-alternating Links, Recursive families of graphs, Counting structures in the Möbius ladder, Spanning trees on hypercubic lattices and nonorientable surfaces