Pages that link to "Item:Q4489897"

The following pages link to Spanning trees on graphs and lattices in<i>d</i>dimensions (Q4489897):

Displaying 50 items.

• Families of metrized graphs with small tau constants (Q295287) (← links)
• Asymptotic Laplacian-energy-like invariant of lattices (Q298828) (← links)
• The spectrum and Laplacian spectrum of the dice lattice (Q315681) (← links)
• The critical group of a clique-inserted graph (Q394343) (← links)
• On some Tutte polynomial sequences in the square lattice (Q412170) (← links)
• The asymptotic behavior of some indices of iterated line graphs of regular graphs (Q423938) (← links)
• The energy and spanning trees of the Aztec diamonds (Q616359) (← links)
• Resistance scaling and the number of spanning trees in self-similar lattices (Q633130) (← links)
• The number of spanning trees in self-similar graphs (Q659629) (← links)
• A unified approach to the asymptotic topological indices of various lattices (Q670763) (← links)
• Asymptotics and arithmetical properties of complexity for circulant graphs (Q721814) (← links)
• Counting rooted spanning forests in cobordism of two circulant graphs (Q779138) (← links)
• Spanning trees on the Sierpinski gasket (Q878373) (← links)
• The number and degree distribution of spanning trees in the Tower of Hanoi graph (Q897918) (← links)
• Enumerating spanning trees of graphs with an involution (Q1024367) (← links)
• Tutte polynomials and related asymptotic limiting functions for recursive families of graphs (Q1432997) (← links)
• Counting spanning trees in cobordism of two circulant graphs (Q1615746) (← links)
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs (Q1672982) (← links)
• New method for counting the number of spanning trees in a two-tree network (Q1673210) (← links)
• The triangular kagomé lattices revisited (Q1673308) (← links)
• An iteration method for computing the total number of spanning trees and its applications in graph theory (Q1686071) (← links)
• Enumeration of spanning trees in the sequence of Dürer graphs (Q1698483) (← links)
• On the incidence energy of some toroidal lattices (Q1724401) (← links)
• The evaluation of the number and the entropy of spanning trees on generalized small-world networks (Q1741668) (← links)
• The number of spanning trees of a class of self-similar fractal models (Q1751423) (← links)
• Enumeration of spanning trees in planar unclustered networks (Q1782858) (← links)
• Potts model partition functions on two families of fractal lattices (Q1783100) (← links)
• Asymptotic incidence energy of lattices (Q1783357) (← links)
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic (Q1999743) (← links)
• Merrifield-Simmons index and its entropy of the 4-8-8 lattice (Q2016569) (← links)
• Complexity of the circulant foliation over a graph (Q2025146) (← links)
• Examples of homological torsion and volume growth (Q2043337) (← links)
• Lehmer's question, graph complexity growth and links (Q2045880) (← links)
• Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs (Q2067108) (← links)
• A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters (Q2148240) (← links)
• Enumeration of spanning trees of 2-separable networks (Q2164266) (← links)
• Study of exponential growth constants of directed heteropolygonal Archimedean lattices (Q2316371) (← links)
• Analyzing lattice networks through substructures (Q2318224) (← links)
• Topological properties of a 3-regular small world network (Q2320667) (← links)
• Complexity of discrete Seifert foliations over a graph (Q2332088) (← links)
• Spanning trees and dimer problem on the Cairo pentagonal lattice (Q2335635) (← links)
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials (Q2361566) (← links)
• Enumeration of spanning trees of graphs with rotational symmetry (Q2431603) (← links)
• The number of spanning trees in Apollonian networks (Q2449073) (← links)
• Renormalization flow for unrooted forests on a triangular lattice (Q2461653) (← links)
• The number of spanning trees of plane graphs with reflective symmetry (Q2568971) (← links)
• On the entropy of spanning trees on a large triangular lattice (Q2583523) (← links)
• A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks (Q2672618) (← links)
• Vertex-colored graphs, bicycle spaces and Mahler measure (Q2809229) (← links)
• Counting spanning trees in self-similar networks by evaluating determinants (Q2851758) (← links)