On the number of spanning trees on various lattices

被引:29
|
作者
Teuf, E. [1 ]
Wagner, S. [2 ]
机构
[1] Univ Tubingen, Math Inst, D-72076 Tubingen, Germany
[2] Univ Stellenbosch, Dept Math Sci, ZA-7602 Stellenbosch, South Africa
基金
新加坡国家研究基金会;
关键词
PERCOLATION;
D O I
10.1088/1751-8113/43/41/415001
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We consider the number of spanning trees in lattices; for a lattice L, one defines the bulk limit z(L) = lim(vertical bar VG vertical bar ->infinity)(log N(ST)(G))/vertical bar VG vertical bar, where N(ST) (G) is the number of spanning trees in a finite section G of L. Explicit values for z(L) are known in various special cases. In this note we describe a simple yet effective method to deduce relations between the values of z(L) for different lattices L by means of electrical network theory.
引用
收藏
页数:8
相关论文
共 50 条
  • [31] The Number of Spanning Trees in the Composition Graphs
    Li, Feng
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2014, 2014
  • [32] The number of spanning trees of a graph with given matching number
    Feng, Lihua
    Xu, Kexiang
    Das, Kinkar Ch.
    Ilic, Aleksandar
    Yu, Guihai
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2016, 93 (06) : 837 - 843
  • [33] Ancestor Approach to Number of Spanning Trees of Wheel Graph Wn in Terms of Number of Spanning Trees of Fan Graph Fn
    Biswal, Purna Chandra
    ADVANCED SCIENCE LETTERS, 2016, 22 (02) : 567 - 569
  • [34] The asymptotic number of spanning trees in circulant graphs
    Golin, Mordecai J.
    Yong, Xuerong
    Zhang, Yuanping
    DISCRETE MATHEMATICS, 2010, 310 (04) : 792 - 803
  • [35] Upper bounds for the number of spanning trees of graphs
    Ş Burcu Bozkurt
    Journal of Inequalities and Applications, 2012
  • [36] Maximizing the Number of Spanning Trees in a Connected Graph
    Li, Huan
    Patterson, Stacy
    Yi, Yuhao
    Zhang, Zhongzhi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (02) : 1248 - 1260
  • [37] Number of Spanning Trees in the Sequence of Some Graphs
    Liu, Jia-Bao
    Daoud, S. N.
    COMPLEXITY, 2019, 2019
  • [38] Minimal spanning trees with a constraint on the number of leaves
    Fernandes, LM
    Gouveia, L
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 104 (01) : 250 - 261
  • [39] Upper bounds for the number of spanning trees of graphs
    Bozkurt, S. Burcu
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2012,
  • [40] On the number of spanning trees in graphs with multiple edges
    Sahbani, Hajar
    El Marraki, Mohamed
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2017, 55 (1-2) : 245 - 255