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
Ring structure digraphs: spectrum of adjacency matrix and application, The number of spanning trees in some classes of 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, 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\), The number of spanning trees in odd valent circulant graphs, 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, 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
