Bounds on connective constants of regular graphs
classification
🧮 math.CO
math-phmath.MPmath.PR
keywords
boundsconnectiveprovedconditionsconnectedconstantconstantsdelta-1
read the original abstract
Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker conditions under which it is sharp.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.