Spanning trees on graphs and lattices inddimensions
From MaRDI portal
Publication:4489897
DOI10.1088/0305-4470/33/21/303zbMath0949.05041arXivcond-mat/0004341OpenAlexW2001149343MaRDI QIDQ4489897
No author found.
Publication date: 3 December 2000
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0004341
Programming involving graphs or networks (90C35) Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Related Items (75)
Counting spanning trees in cobordism of two circulant graphs ⋮ On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials ⋮ The number of rooted forests in circulant graphs ⋮ Families of metrized graphs with small tau constants ⋮ Asymptotic Laplacian-energy-like invariant of lattices ⋮ Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ The spectrum and Laplacian spectrum of the dice lattice ⋮ A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters ⋮ DIMERS AND SPANNING TREES: SOME RECENT RESULTS ⋮ Enumeration of spanning trees of 2-separable networks ⋮ Analytic properties for the honeycomb lattice Green function at the origin ⋮ The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs ⋮ New method for counting the number of spanning trees in a two-tree network ⋮ The triangular kagomé lattices revisited ⋮ Spanning trees on the Sierpinski gasket ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ The critical group of a clique-inserted graph ⋮ Coherence in a family of tree networks with an application of Laplacian spectrum ⋮ The energy and spanning trees of the Aztec diamonds ⋮ An iteration method for computing the total number of spanning trees and its applications in graph theory ⋮ On some Tutte polynomial sequences in the square lattice ⋮ On the Jacobian group of a cone over a circulant graph ⋮ Geometrically and diagrammatically maximal knots ⋮ The number and degree distribution of spanning trees in the Tower of Hanoi graph ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ The asymptotic behavior of some indices of iterated line graphs of regular graphs ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Spanning tree bounds for grid graphs ⋮ Resistance scaling and the number of spanning trees in self-similar lattices ⋮ Enumeration of spanning trees of graphs with rotational symmetry ⋮ Sandpile probabilities on triangular and hexagonal lattices ⋮ COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS ⋮ The number of spanning trees in Apollonian networks ⋮ On the incidence energy of some toroidal lattices ⋮ Tutte polynomials and related asymptotic limiting functions for recursive families of graphs ⋮ On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials ⋮ The number of spanning trees in self-similar graphs ⋮ Some physical and chemical indices of clique-inserted lattices ⋮ Enumeration of spanning trees on Apollonian networks ⋮ Some physical and chemical indices of the Union Jack lattice ⋮ Renormalization flow for unrooted forests on a triangular lattice ⋮ A unified approach to the asymptotic topological indices of various lattices ⋮ On the Kirchhoff index of some toroidal lattices ⋮ The evaluation of the number and the entropy of spanning trees on generalized small-world networks ⋮ The number of spanning trees of a class of self-similar fractal models ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ Zeta functions, heat kernels, and spectral asymptotics on degenerating families of discrete tori ⋮ Structural properties of Potts model partition functions and chromatic polynomials for lattice strips ⋮ Exact Potts model partition functions on strips of the honeycomb lattice ⋮ Exact Potts model partition functions on wider arbitrary-length strips of the square lattice ⋮ Merrifield-Simmons index and its entropy of the 4-8-8 lattice ⋮ Complexity of the circulant foliation over a graph ⋮ Enumeration of spanning trees in planar unclustered networks ⋮ Potts model partition functions on two families of fractal lattices ⋮ Asymptotic incidence energy of lattices ⋮ Asymptotics and arithmetical properties of complexity for circulant graphs ⋮ Examples of homological torsion and volume growth ⋮ Vertex-colored graphs, bicycle spaces and Mahler measure ⋮ Lehmer's question, graph complexity growth and links ⋮ Unnamed Item ⋮ Enumerating spanning trees of graphs with an involution ⋮ Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs ⋮ Study of exponential growth constants of directed heteropolygonal Archimedean lattices ⋮ Analyzing lattice networks through substructures ⋮ Topological properties of a 3-regular small world network ⋮ Counting rooted spanning forests in cobordism of two circulant graphs ⋮ The number of spanning trees of plane graphs with reflective symmetry ⋮ Complexity of discrete Seifert foliations over a graph ⋮ Counting spanning trees in self-similar networks by evaluating determinants ⋮ Spanning trees and dimer problem on the Cairo pentagonal lattice ⋮ DIMERS ON TWO-DIMENSIONAL LATTICES ⋮ On the entropy of spanning trees on a large triangular lattice ⋮ The complexity of specific commuting graphs ⋮ Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L
This page was built for publication: Spanning trees on graphs and lattices inddimensions
