Spanning tree formulas and Chebyshev polynomials
From MaRDI portal
Publication:1106235
DOI10.1007/BF01788093zbMath0651.05028MaRDI QIDQ1106235
Publication date: 1986
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Trees (05C05) Enumeration in graph theory (05C30) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)
Related Items
Counting spanning trees in cobordism of two circulant graphs ⋮ The number of spanning trees in a new lexicographic product of graphs ⋮ On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials ⋮ The number of rooted forests in circulant graphs ⋮ Effective resistances and Kirchhoff index of ladder graphs ⋮ Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI ⋮ The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\) ⋮ Weighted complexities of graph products and bundles ⋮ The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs ⋮ On the structure of the Jacobian group for circulant graphs ⋮ Further analysis of the number of spanning trees in circulant graphs ⋮ Coding and counting spanning trees in Kleitman-Golden graphs ⋮ Maximizing the number of spanning trees on the (p,p+2) graphs ⋮ On the number of spanning trees in graphs with multiple edges ⋮ The number of spanning trees in directed circulant graphs with non-fixed jumps ⋮ Ring structure digraphs: spectrum of adjacency matrix and application ⋮ Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori ⋮ Counting rooted spanning forests for circulant foliation over a graph ⋮ Enumeration of spanning trees in prisms of some graphs ⋮ On the Jacobian group of a cone over a circulant graph ⋮ How Many Unicycles on a Wheel? ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ The number of spanning trees in a class of double fixed-step loop networks ⋮ The number of spanning trees in the composition graphs ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ On the complexity of a class of pyramid graphs and Chebyshev polynomials ⋮ On the number of spanning trees in directed circulant graphs ⋮ On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials ⋮ The multi-fan graphs are determined by their Laplacian spectra ⋮ Characterizing immutable sandpiles: a first look ⋮ Spanning forests and the golden ratio ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ The number of spanning trees in some classes of graphs ⋮ 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? ⋮ Complexity of the circulant foliation over a graph ⋮ Asymptotics and arithmetical properties of complexity for circulant graphs ⋮ The number of spanning trees in odd valent circulant graphs ⋮ Counting rooted spanning forests in cobordism of two circulant graphs ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs ⋮ Complexity of discrete Seifert foliations over a graph ⋮ Spanning trees of descendants of a complete graph ⋮ The formulas for the 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
- The number of spanning trees in a prism
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
