The number of spanning trees in circulant graphs
From MaRDI portal
Publication:1587617
DOI10.1016/S0012-365X(99)00414-8zbMath0969.05036OpenAlexW2131919585MaRDI QIDQ1587617
Yuanping Zhang, Mordecai J. Golin, Xue-rong Yong
Publication date: 3 December 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00414-8
Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (34)
Counting spanning trees in cobordism of two circulant graphs ⋮ The number of spanning trees in a new lexicographic product of graphs ⋮ On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials ⋮ The number of rooted forests in circulant graphs ⋮ Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ Counting the number of spanning trees in a class of double fixed-step loop networks ⋮ On the sandpile group of the square cycle \(C^{2}_{n}\) ⋮ On the structure of the Jacobian group for circulant graphs ⋮ Further analysis of the number of spanning trees in circulant graphs ⋮ The number of spanning trees in directed circulant graphs with non-fixed jumps ⋮ Ring structure digraphs: spectrum of adjacency matrix and application ⋮ Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Counting spanning trees using modular decomposition ⋮ The number of spanning trees in a class of double fixed-step loop networks ⋮ Spectra of subdivision-vertex join and subdivision-edge join of two graphs ⋮ The number of spanning trees in the composition graphs ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ Number of spanning trees of different products of complete and complete bipartite graphs ⋮ Recursively constructible families of graphs ⋮ On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials ⋮ Spanning trees: A survey ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ The asymptotic number of spanning trees in circulant graphs ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ Asymptotics and arithmetical properties of complexity for circulant graphs ⋮ Counting Spanning Trees in Graphs Using Modular Decomposition ⋮ Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs ⋮ Unnamed Item ⋮ The number of spanning trees in odd valent circulant graphs ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs ⋮ The formulas for the number of spanning trees in circulant graphs
This page was built for publication: The number of spanning trees in circulant graphs
