Spanning tree formulas and Chebyshev polynomials
From MaRDI portal
Recommendations
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- Further applications of Chebyshev polynomials in the derivation of spanning tree formulas for circulant graphs
- The number of spanning tree in several classes of graphs
- Chebyshev polynomials and spanning tree formulas
- Chebyshev polynomials and formulas for a number of spanning trees in circulant graphs
Cites work
- A certain polynomial of a graph and graphs with an extremal number of trees
- A theory of linear descent based upon Hopf algebraic techniques
- Counting Trees in a Certain Class of Graphs
- scientific article; zbMATH DE number 3941580 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 3485895 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- scientific article; zbMATH DE number 3277020 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- scientific article; zbMATH DE number 3342967 (Why is no real title available?)
- scientific article; zbMATH DE number 3194323 (Why is no real title available?)
- The number of spanning trees in a prism
Cited in
(53)- The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
- 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
- The number of spanning trees in the composition graphs
- The number of spanning trees of the Cartesian product of regular graphs
- The number of spanning trees in odd valent circulant graphs
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- Complexity of the circulant foliation over a graph
- Spanning trees of descendants of a complete graph
- Characterizing immutable sandpiles: a first look
- Complexity of discrete Seifert foliations over a 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
- Spanning forests and the golden ratio
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- Counting rooted spanning forests for circulant foliation over a graph
- On the number of spanning trees in directed circulant graphs
- Effective resistances and Kirchhoff index of ladder 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 a class of double fixed-step loop networks
- The number of spanning tree in several classes of graphs
- Coding and counting spanning trees in Kleitman-Golden graphs
- Maximizing the number of spanning trees on the (p,p+2) graphs
- Further applications of Chebyshev polynomials in the derivation of spanning tree formulas for circulant graphs
- On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
- The number of spanning trees of the regular networks
- On the complexity of a class of pyramid graphs and Chebyshev polynomials
- Chebyshev polynomials and spanning tree formulas
- The number of rooted forests in circulant graphs
- Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
- The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs
- How many unicycles on a wheel?
- Enumeration of spanning trees in prisms of some graphs
- On the Jacobian group of a cone over a circulant graph
- Ring structure digraphs: spectrum of adjacency matrix and application
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
- The number of spanning trees in a superprism
- The number of spanning trees in some classes of graphs
- On the complexity of Cayley graphs on a dihedral group
- On the structure of Laplacian characteristic polynomial for circulant foliation
- On Jacobian group and complexity of the -graph
- Asymptotics and arithmetical properties of complexity for circulant graphs
- Counting rooted spanning forests in cobordism of two circulant graphs
- Weighted complexities of graph products and bundles
- 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 multi-fan graphs are determined by their Laplacian spectra
- The asymptotic number of spanning trees in circulant graphs
- An efficient approach for counting the number of spanning trees in circulant and related graphs
- Which digraphs with ring structure are essentially cyclic?
This page was built for publication: Spanning tree formulas and Chebyshev polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106235)