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)
05C05: Trees
05C30: Enumeration in graph theory
33C45: Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.)
Related Items
On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials, Effective resistances and Kirchhoff index of ladder graphs, On the structure of the Jacobian group for circulant graphs, On the complexity of a class of pyramid graphs and Chebyshev polynomials, Ring structure digraphs: spectrum of adjacency matrix and application, The number of spanning trees in some classes of graphs, Asymptotics and arithmetical properties of complexity for 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?, 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 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, On the number of spanning trees in directed 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, Coding and counting spanning trees in Kleitman-Golden graphs, Maximizing the number of spanning trees on the (p,p+2) 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
