Pages that link to "Item:Q878373"

The following pages link to Spanning trees on the Sierpinski gasket (Q878373):

Displaying 50 items.

• Tutte polynomial of scale-free networks (Q301807) (← links)
• The spectrum and Laplacian spectrum of the dice lattice (Q315681) (← links)
• Enumeration of matchings in families of self-similar graphs (Q608260) (← 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)
• Spanning 2-forests and resistance distance in 2-connected graphs (Q777403) (← links)
• Laplacian growth and sandpiles on the Sierpiński gasket: limit shape universality and exact solutions (Q826442) (← links)
• Tutte polynomial of pseudofractal scale-free web (Q888270) (← links)
• The number and degree distribution of spanning trees in the Tower of Hanoi graph (Q897918) (← links)
• Determinant identities for Laplace matrices (Q1044622) (← links)
• Enumeration of spanning trees on contact graphs of disk packings (Q1618515) (← links)
• Regularized Laplacian determinants of self-similar fractals (Q1639947) (← 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)
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← 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)
• Invulnerability of planar two-tree networks (Q1733045) (← links)
• Enumeration of spanning trees in planar unclustered networks (Q1782858) (← links)
• Potts model partition functions on two families of fractal lattices (Q1783100) (← links)
• Some two-point resistances of the Sierpinski gasket network (Q1785685) (← links)
• Complexity of the circulant foliation over a graph (Q2025146) (← links)
• A general method for computing Tutte polynomials of self-similar graphs (Q2147865) (← 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)
• Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly (Q2216213) (← links)
• A new class of the planar networks with high clustering and high entropy (Q2319116) (← links)
• Topological properties of a 3-regular small world network (Q2320667) (← links)
• Number of spanning trees in the sequence of some graphs (Q2325140) (← 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)
• Loop-erased random walk on the Sierpinski gasket (Q2434493) (← links)
• The number of spanning trees in Apollonian networks (Q2449073) (← links)
• Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network (Q2669319) (← links)
• A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks (Q2672618) (← links)
• Counting spanning trees in self-similar networks by evaluating determinants (Q2851758) (← links)
• ACYCLIC ORIENTATIONS ON THE SIERPINSKI GASKET (Q2861306) (← links)
• Enumeration of spanning trees on Apollonian networks (Q3301692) (← links)
• Some physical and chemical indices of the Union Jack lattice (Q3302189) (← links)
• MEAN TIME TO ABSORPTION ON THE JOINT SIERPINSKI GASKET (Q5023949) (← links)
• AVERAGE TRAPPING TIME ON THE 3-DIMENSIONAL 3-LEVEL SIERPINSKI GASKET NETWORK WITH A SET OF TRAP NODES (Q5046680) (← links)
• The localization of quantum random walks on Sierpinski gaskets (Q5056511) (← links)
• THE AVERAGE TRAPPING TIME WITH NON-NEAREST-NEIGHBOR JUMPS ON THE LEVEL-3 SIERPINSKI GASKET (Q5062371) (← links)
• Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures (Q5066050) (← links)
• MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB (Q5086261) (← links)
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS (Q5121317) (← links)
• <i>q</i>-plane zeros of the Potts partition function on diamond hierarchical graphs (Q5140971) (← links)
• Mixing time and eigenvalues of the abelian sandpile Markov chain (Q5243105) (← links)