Bounds on connective constants of regular graphs
Abstract
Bounds are proved for the connective constant μ\ of an infinite, connected, -regular graph G. The main result is that μ\ -1 if G is vertex-transitive and simple. This inequality is proved subject to weaker conditions under which it is sharp.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.