Asymptotic connectivity of hyperbolic planar graphs (Q607003): Difference between revisions

\textit{P. Bahls} [Discrete Math. 309, No.\,8, 2250--2259 (2009; Zbl 1202.05074)] introduced the notion of asymptotic connectivity as a generalization to infinite graphs of the definition of average connectivity by \textit{L.\,W. Beineke}, \textit{O.\,R. Oellermann} and \textit{R.\,E. Pippert} [Discrete Math. 252, No.\,1-3, 31--45 (2002; Zbl 1002.05040)]. The average connectivity of a graph is defined as the sum of the connectivity numbers of each distinct pair of vertices divided through the number of the distinct pairs. The authors prove the existence and compute an upper bound for the asymptotic connectivity of almost any regular hyperbolic tiling of the plane.