Pages that link to "Item:Q1106235"

The following pages link to Spanning tree formulas and Chebyshev polynomials (Q1106235):

Displaying 46 items.

• Effective resistances and Kirchhoff index of ladder graphs (Q282210) (← links)
• On the structure of the Jacobian group for circulant graphs (Q339986) (← links)
• On the complexity of a class of pyramid graphs and Chebyshev polynomials (Q474169) (← links)
• Ring structure digraphs: spectrum of adjacency matrix and application (Q612086) (← links)
• The number of spanning trees in some classes of graphs (Q691272) (← links)
• Asymptotics and arithmetical properties of complexity for circulant graphs (Q721814) (← links)
• Counting rooted spanning forests in cobordism of two circulant graphs (Q779138) (← links)
• Weighted complexities of graph products and bundles (Q854826) (← links)
• Further analysis of the number of spanning trees in circulant graphs (Q860448) (← links)
• The number of spanning trees in directed circulant graphs with non-fixed jumps (Q882110) (← links)
• Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori (Q893895) (← links)
• The multi-fan graphs are determined by their Laplacian spectra (Q941355) (← links)
• The asymptotic number of spanning trees in circulant graphs (Q965958) (← links)
• An efficient approach for counting the number of spanning trees in circulant and related graphs (Q966019) (← links)
• Which digraphs with ring structure are essentially cyclic? (Q984026) (← links)
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\) (Q1357759) (← links)
• Counting spanning trees in cobordism of two circulant graphs (Q1615746) (← links)
• The number of spanning trees in a new lexicographic product of graphs (Q1616174) (← links)
• On the number of spanning trees in graphs with multiple edges (Q1677130) (← links)
• The number of spanning trees in the composition graphs (Q1718771) (← links)
• The number of spanning trees of the Cartesian product of regular graphs (Q1719076) (← links)
• The number of spanning trees in odd valent circulant graphs (Q1827730) (← links)
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic (Q1999743) (← links)
• Complexity of the circulant foliation over a graph (Q2025146) (← links)
• Spanning trees of descendants of a complete graph (Q2109090) (← links)
• Characterizing immutable sandpiles: a first look (Q2237231) (← links)
• Complexity of discrete Seifert foliations over a graph (Q2332088) (← links)
• The formulas for the number of spanning trees in circulant graphs (Q2352053) (← links)
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials (Q2361566) (← links)
• Spanning forests and the golden ratio (Q2476266) (← links)
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs (Q2566290) (← links)
• Counting rooted spanning forests for circulant foliation over a graph (Q2679743) (← links)
• On the number of spanning trees in directed circulant graphs (Q2719844) (← links)
• A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI (Q3458375) (← links)
• The number of spanning trees in a class of double fixed-step loop networks (Q3528151) (← links)
• Coding and counting spanning trees in Kleitman-Golden graphs (Q4007354) (← links)
• Maximizing the number of spanning trees on the (<i>p,</i><i>p</i>+2) graphs (Q4009724) (← links)
• On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials (Q4629559) (← links)
• The number of rooted forests in circulant graphs (Q5037930) (← links)
• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics (Q5056827) (← links)
• The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs (Q5069737) (← links)
• How Many Unicycles on a Wheel? (Q5108567) (← links)
• Enumeration of spanning trees in prisms of some graphs (Q6113663) (← links)
• On the Jacobian group of a cone over a circulant graph (Q6117337) (← links)
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)
• The number of spanning trees in a superprism (Q6561584) (← links)