Gromov hyperbolicity in lexicographic product graphs

preprint2015arXivOpen access

Abstract

If XX is a geodesic metric space and x1,x2,x3∈Xx_1,x_2,x_3\in X, a {\it geodesic triangle} T={x1,x2,x3}T=\{x_1,x_2,x_3\} is the union of the three geodesics [x1x2][x_1x_2], [x2x3][x_2x_3] and [x3x1][x_3x_1] in XX. The space XX is δδ-\emph{hyperbolic} ((in the Gromov sense)) if any side of TT is contained in a δδ-neighborhood of the union of the two other sides, for every geodesic triangle TT in XX. If XX is hyperbolic, we denote by δ(X)δ(X) the sharp hyperbolicity constant of XX, i.e. $δ(X)=\inf\{δ\ge 0: \, X \, \text{ is $δ$-hyperbolic}\}.$ In this paper we characterize the lexicographic product of two graphs G1∘G2G_1\circ G_2 which are hyperbolic, in terms of G1G_1 and G2G_2: the lexicographic product graph G1∘G2G_1\circ G_2 is hyperbolic if and only if G1G_1 is hyperbolic, unless if G1G_1 is a trivial graph (the graph with a single vertex); if G1G_1 is trivial, then G1∘G2G_1\circ G_2 is hyperbolic if and only if G2G_2 is hyperbolic. In particular, we obtain the sharp inequalities δ(G1)≤δ(G1∘G2)≤δ(G1)+3/2δ(G_1)\le δ(G_1\circ G_2) \le δ(G_1) + 3/2 if G1G_1 is not a trivial graph, and we characterize the graphs for which the second inequality is attained.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.