Publication:5659582
From MaRDI portal
zbMath0247.05142MaRDI QIDQ5659582
Publication date: 1970
Related Items
The number of rooted forests in circulant graphs, Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics, Path intersection matrices and applications to networks, The number of spanning trees of the generalized Boolean \(n\)-cube network, Counting structures in the Möbius ladder, Spanning trees on hypercubic lattices and nonorientable surfaces, The number of spanning trees of the generalized hypercube network, The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic, Spanning forests and the golden ratio, Recursive families of graphs, From Goeritz Matrices to Quasi-alternating Links