Small values of the hyperbolicity constant in graphs

If X is a geodesic metric space and x1, x2, x3 ∈ X , a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X . The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X . We denote by δ(X) the sharpest hyperbolicity constant of X , i.e., δ(X) := ı́nf{δ ≥ 0 : X is δ-hyperbolic }. In the study of any parameter on graphs it is natural to study the graphs for which this parameter has small values. In this work we study the graphs (with every edge of length k) with small hyperbolicity constant, i.e., the graphs which are like trees (in the Gromov sense). In this work we obtain simple characterizations of the graphs G with δ(G) = k and δ(G) = 5k 4 (the case δ(G) < k is known). Also, we give a necessary condition in order to have δ(G) = 3k 2 (we know that δ(G) is a multiple of k 4 ). Although it is not possible to obtain bounds for the diameter of graphs with small hyperbolicity constant, we obtain such bounds for the effective diameter if δ(G) < 3k 2 . This is the best possible result, since we prove that it is not possible to obtain similar bounds if (.G) ≥ 3k 2 .