The number of spanning trees in circulant graphs

DOI10.1016/S0012-365X(99)00414-8MaRDI QIDQ1587617zbMATH OpenOpenAlexFDO

Authors Yuanping Zhang, Mordecai J. Golin, Xuerong 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

zbMATH Keywords

determinantcirculant graphsmatrix tree theoremnumber of spanning treesCayley's tree formula

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Enumeration in graph theory (05C30)

Recommendations

• An efficient approach for counting the number of spanning trees in circulant and related graphs
• The numbers of spanning trees in undirected circulant graphs
• The number of spanning trees in some circulant graphs with non-fixed jumps
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• The number of spanning trees in directed circulant graphs

Cited in

(62)

• Counting spanning trees of \((1, N\))-periodic graphs
• On two conjectures concerning spanning tree edge dependences of graphs
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
• The number of spanning trees in the undirected circulant graphs with non-fixed jumps
• scientific article; zbMATH DE number 2230252 (Why is no real title available?)
• On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs
• An efficient approach for counting the number of spanning trees in circulant and related graphs
• Oriented spanning trees and stationary distribution of digraphs
• scientific article; zbMATH DE number 3966096 (Why is no real title available?)
• scientific article; zbMATH DE number 5532173 (Why is no real title available?)
• The number of spanning trees in some circulant graphs with non-fixed jumps
• Graph-Theoretic Concepts in Computer Science
• Counting the number of spanning trees in a class of double fixed-step loop networks
• On the number of spanning trees of circulant graphs
• Counting spanning trees in cobordism of two circulant graphs
• Number of spanning trees of some circulant graphs and their asymptotic behavior
• The number of spanning trees in the composition graphs
• An iteration method for computing the total number of spanning trees and its applications in graph theory
• Further analysis of the number of spanning trees in circulant graphs
• The asymptotic number of spanning trees in circulant graphs
• Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
• Counting trees in directed regular multigraphs
• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• The number of spanning trees in self-similar graphs
• Ring structure digraphs: spectrum of adjacency matrix and application
• On the sandpile group of the square cycle \(C^{2}_{n}\)
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• The formulas for the number of spanning trees in circulant graphs
• The number of spanning trees in directed circulant graphs with non-fixed jumps
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
• On the number of spanning trees in directed circulant graphs
• scientific article; zbMATH DE number 1926055 (Why is no real title available?)
• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
• Counting spanning trees in graphs using modular decomposition
• The number of spanning trees in a new lexicographic product of graphs
• Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori
• The numbers of spanning trees in undirected circulant graphs
• Number of spanning trees of different products of complete and complete bipartite graphs
• The number of spanning trees of the Cartesian product of regular graphs
• Recursively constructible families of graphs
• Counting spanning trees using modular decomposition
• On Jacobian group and complexity of \(I\)-graph \(I(n, k, l)\) through Chebyshev polynomials
• A formula for the number of spanning trees in circulant graphs with nonfixed generators and discrete tori
• Algorithms and Computation
• Asymptotics and arithmetical properties of complexity for circulant graphs
• The number of rooted forests in circulant graphs
• scientific article; zbMATH DE number 140113 (Why is no real title available?)
• The number of spanning trees in directed circulant graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• The number of spanning trees in odd valent circulant graphs
• Counting spanning trees in grid graphs
• Spanning trees in directed circulant graphs and cycle power graphs
• On the structure of the Jacobian group for circulant graphs
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• The number of spanning trees in a class of double fixed-step loop networks
• On the number of spanning trees in graphs with multiple edges
• Circulant matrices and the spectra of de Bruijn graphs
• Spectra of subdivision-vertex join and subdivision-edge join of two graphs
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• The number of spanning trees of the Bruhat graph
• Spanning trees: A survey
• scientific article; zbMATH DE number 1827742 (Why is no real title available?)

This page was built for publication: The number of spanning trees in circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587617)