On a classical theorem on the diameter and minimum degree of a graph.

In this work, we obtain good upper bounds for the diameter of any graph in terms of its minimum degree and its order, improving a classical theorem due to Erdös, Pach, Pollack and Tuza. We use these bounds in order to study hyperbolic graphs (in the Gromov sense). To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let H( n, δ ) be the set of graphs G with n vertices and minimum degree δ , and J( n, Δ) be the set of graphs G with n vertices and maximum degree Δ. We study the four following extremal problems on graphs: a( n, δ ) = min{ δ( G) | G ∈ H( n, δ )}, b( n, δ ) = max{ δ( G) | G ∈ H( n, δ )}, α( n, Δ) = min{ δ( G) | G ∈ J( n, Δ)} and β( n, Δ) = max{ δ( G) | G ∈ J( n, Δ)}. In particular, we obtain bounds for b( n, δ ) and we compute the precise value of a( n, δ ), α( n, Δ) and β( n, Δ) for all values of n, δ and Δ, respectively. [ABSTRACT FROM AUTHOR]