Bounds on connective constants of regular graphs-Reference-Cited by-同舟云学术

Bounds on connective constants of regular graphs

Published:2014-08-22 Issue:3 Volume:35 Page:279-294
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Grimmett Geoffrey R.,Li Zhongyang

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-014-3044-0.pdf

Reference22 articles.

1. S. E. Alm: Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices, J. Phys. A: Math. Gen. 38 (2005), 2055–2080.

2. S. E. Alm and S. Janson: Random self-avoiding walks on one-dimensional lattices, Commun. Statist. Stoch. Models 6 (1990), 169–212.

3. L. Babai: Automorphism groups, isomorphism, reconstruction, Handbook of Combinatorics, vol. II, Elsevier, Amsterdam, 1995, pp. 1447–1540.

4. L. Babai and M. E. Watkins: Connectivity of infinite graphs having a transitive torsion group action, Arch. Math. 34 (1980), 90–96.

5. R. Bauerschmidt, H. Duminil-Copin, J. Goodman and G. Slade: Lectures on self-avoiding-walks, in: Probability and Statistical Physics in Two and More Dimensions (D. Ellwood, C. M. Newman, V. Sidoravicius, and W. Werner, eds.), Clay Mathematics Institute Proceedings, vol. 15, CMI/AMS publication, 2012, 395–476.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Self‐avoiding walks and polygons on hyperbolic graphs;Journal of Graph Theory;2024-02-19

2. Analyticity Results in Bernoulli Percolation;Memoirs of the American Mathematical Society;2023-08

3. Positive speed self-avoiding walks on graphs with more than one end;Journal of Combinatorial Theory, Series A;2020-10

4. Cubic graphs and the golden mean;Discrete Mathematics;2020-01

5. Self-avoiding walk on nonunimodular transitive graphs;The Annals of Probability;2019-09-01