Pages that link to "Item:Q3053181"
From MaRDI portal
The following pages link to On the number of spanning trees on various lattices (Q3053181):
Displayed 21 items.
- The spectrum and Laplacian spectrum of the dice lattice (Q315681) (← links)
- The critical group of a clique-inserted graph (Q394343) (← links)
- New method for counting the number of spanning trees in a two-tree network (Q1673210) (← 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)
- Enumeration of spanning trees of middle graphs (Q1736137) (← links)
- Enumeration of spanning trees in planar unclustered networks (Q1782858) (← links)
- Potts model partition functions on two families of fractal lattices (Q1783100) (← 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)
- An algorithm for delta-wye reduction of almost-planar graphs (Q2197481) (← links)
- Spanning trees and dimer problem on the Cairo pentagonal lattice (Q2335635) (← 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)
- Some physical and chemical indices of clique-inserted lattices (Q3301409) (← links)
- Some physical and chemical indices of the Union Jack lattice (Q3302189) (← links)
- Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models (Q5043082) (← links)
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS (Q5121317) (← links)
- Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L (Q5877278) (← links)
- Spanning tree bounds for grid graphs (Q6197797) (← links)