The number of spanning trees in circulant graphs

DOI10.1016/S0012-365X(99)00414-8zbMATH Open0969.05036OpenAlexW2131919585MaRDI QIDQ1587617FDOQ1587617

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

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

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)

Cited In (62)

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

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)