On the Hyperbolicity of Random Graphs

Electronic Journal Of Combinatorics

Dieter Mitsche¹ 

关键词: random graphs;    hyperbolicity;    diameter;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $G=(V,E)$ be a connected graph with the usual (graph) distance metric $d:V \times V \to \mathbb{N} \cup \{0 \}$. Introduced by Gromov, $G$ is $\delta$-hyperbolic if for every four vertices $u,v,x,y \in V$, the two largest values of the three sums $d(u

【 授权许可】

Others