Hyperbolicity of direct products of graphs Articles uri icon

publication date

  • July 2018

start page

  • 1

end page

  • 25


  • 7


  • 10 (279)

Electronic International Standard Serial Number (EISSN)

  • 2073-8994


  • It is well-known that the different products of graphs are some of the more symmetric classes of graphs. Since we are interested in hyperbolicity, it is interesting to study this property in products of graphs. Some previous works characterize the hyperbolicity of several types of product graphs (Cartesian, strong, join, corona and lexicographic products). However, the problem with the direct product is more complicated. The symmetry of this product allows us to prove that, if the direct product G(1) x G(2) is hyperbolic, then one factor is bounded and the other one is hyperbolic. Besides, we prove that this necessary condition is also sufficient in many cases. In other cases, we find (not so simple) characterizations of hyperbolic direct products. Furthermore, we obtain good bounds, and even formulas in many cases, for the hyperbolicity constant of the direct product of some important graphs (as products of path, cycle and even general bipartite graphs).


  • Mathematics


  • direct product of graphs; geodesics; gromov hyperbolicity; bipartite graphs