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

Cayley's tree formulacirculant graphsdeterminantmatrix tree theoremnumber of spanning trees

Mathematics Subject Classification ID

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

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

(68)

• Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• Cycles and spanning trees
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• Recursively constructible families of graphs
• Counting spanning trees in cobordism of two circulant graphs
• The number of spanning trees in a new lexicographic product of graphs
• On the number of spanning trees in graphs with multiple edges
• An iteration method for computing the total number of spanning trees and its applications in graph theory
• 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
• The number of spanning trees in odd valent circulant graphs
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• The number of spanning trees of the Bruhat graph
• The formulas for the number of spanning trees in circulant graphs
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
• Counting spanning trees using modular decomposition
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Counting spanning trees in grid graphs
• On the number of spanning trees in directed circulant graphs
• The numbers of spanning trees in undirected circulant graphs
• Number of spanning trees of some circulant graphs and their asymptotic behavior
• Counting spanning trees in graphs using modular decomposition
• Circulant matrices and the spectra of de Bruijn graphs
• On the number of spanning trees of circulant graphs
• On the structure of the Jacobian group for circulant graphs
• A formula for the number of spanning trees in circulant graphs with nonfixed generators and discrete tori
• The number of spanning trees in some circulant graphs with non-fixed jumps
• The number of spanning trees in a class of double fixed-step loop networks
• scientific article; zbMATH DE number 5532173 (Why is no real title available?)
• scientific article; zbMATH DE number 3966096 (Why is no real title available?)
• scientific article; zbMATH DE number 140113 (Why is no real title available?)
• On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
• scientific article; zbMATH DE number 1926055 (Why is no real title available?)
• scientific article; zbMATH DE number 1827742 (Why is no real title available?)
• The number of rooted forests in circulant graphs
• Spanning trees in directed circulant graphs and cycle power graphs
• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs
• The number of spanning trees in directed circulant graphs
• 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?)
• Graph-Theoretic Concepts in Computer Science
• Algorithms and Computation
• Ring structure digraphs: spectrum of adjacency matrix and application
• Oriented spanning trees and stationary distribution of digraphs
• 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
• The number of spanning trees in self-similar graphs
• Spanning trees: A survey
• On a conjecture regarding spanning tree edge dependences of planar graphs
• The number of spanning trees of the bipartite complement of a semiregular bipartite graph
• On the complexity of Cayley graphs on a dihedral group
• The structure of the characteristic polynomial of the Laplacian matrix for a circulant graph with non-fixed jumps
• On Jacobian group and complexity of the -graph
• Asymptotics and arithmetical properties of complexity for circulant graphs
• Counting trees in directed regular multigraphs
• 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}\)
• 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
• The asymptotic number of spanning trees in circulant graphs
• An efficient approach for counting the number of spanning trees in circulant and related graphs

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)