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 Erdos, 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, δ0） be the set of graphs G with n vertices and minimum degree 50, and J（n, Δ） be the set of graphs G with n vertices and maximum degree A. We study the four following extremal problems on graphs： a（n,δ0） = min{δ（G） ｜ G ∈H（n, δ0）}, b（n, δ0） =- max{δ（G）｜ e ∈H（n, δ0）}, α（n, Δ） = min{δ（G） [ G ∈ J（n, Δ）} and β（n,Δ） = max{δ（G） ] G∈Π（n,Δ）}. In particular, we obtain bounds for b（n, δ0） and we compute the precise value of a（n, δ0）, α（n, Δ） and w（n, Δ） for all values of n, r0 and A, respectively.

Erratum to “On a Classical Theorem on the Diameter and Minimum Degree of a Graph”

The original version of the article was published in [1]. Unfortunately, the original version of this article contains a mistake： in Theorem 6.2 appears that β（n, △） = （n-△ ＋ 5）/4 but the correct statement is β（n, △） = （n -△ ＋ 4）/4. In this erratum we correct the theorem and give the correct proof.

Gromov Hyperbolicity of Periodic Planar Graphs

The study of hyperbolic graphs is an interesting topic since the hyperbolicity of a geodesic metric space is equivalent to the hyperbolicity of a graph related to it.The main result in this paper is a very simple characterization of the hyperbolicity of a large class of periodic planar graphs.