The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
From MaRDI portal
Publication:1357759
DOI10.1016/S0012-365X(96)00092-1zbMath0879.05036OpenAlexW2144110267MaRDI QIDQ1357759
Publication date: 8 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00092-1
Related Items (17)
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 ⋮ Further analysis of the number of spanning trees in circulant graphs ⋮ The number of spanning trees in directed circulant graphs with non-fixed jumps ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ 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
Cites Work
This page was built for publication: The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
