Abstract:In this paper we obtain the equivalence of the Gromov hyperbolicity between an extensive class of complete Riemannian surfaces with pinched negative curvature and certain kind of simple graphs, whose edges have length 1, constructed following an easy triangular design of geodesics in the surface.
Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph G M is hyperbolic and that δ(G M ) is comparable to diam(G M ). Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs; in fact, it is shown that 5/4 ≤ δ(G M ) ≤ 5/2. Graphs G whose Mycielskian have hyperbolicity constant 5/4 or 5/2 are characterized. The hyperbolicity constants of the Mycielskian of path, cycle, complete and complete bipartite graphs are calculated explicitly. Finally, information on δ(G) just in terms of δ(G M ) is obtained.
Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph G M is hyperbolic and that δ(G M ) is comparable to diam(G M ). Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs; in fact, it is shown that 5/4 ≤ δ(G M ) ≤ 5/2. Graphs G whose Mycielskian have hyperbolicity constant 5/4 or 5/2 are characterized. The hyperbolicity constants of the Mycielskian of path, cycle, complete and complete bipartite graphs are calculated explicitly. Finally, information on δ(G) just in terms of δ(G M ) is obtained.
“…In [5], the equivalence of the hyperbolicity of graphs and negatively curved surfaces was proved. The study of hyperbolic graphs is a topic of increasing interest (see, e.g., and the references therein).…”
Abstract:Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. In particular, we are interested in interval and indifference graphs, which are important classes of intersection and Euclidean graphs, respectively. Interval graphs (with a very weak hypothesis) and indifference graphs are hyperbolic. In this paper, we give a sharp bound for their hyperbolicity constants. The main result in this paper is the study of the hyperbolicity constant of every interval graph with edges of length 1. Moreover, we obtain sharp estimates for the hyperbolicity constant of the complement of any interval graph with edges of length 1.
“…The study of mathematical properties of Gromov hyperbolic spaces and its applications is a topic of recent and increasing interest in graph theory; see, for instance [4,5,6,7,8,9,10,11,12,13,14,15,16,17,18].…”
Section: Introductionmentioning
confidence: 99%
“…In [25,Section 1.3] is observed that the hyperbolicity of a geodesic metric space is equivalent to the hyperbolicity of a graph related to it (see also [14,16,17]). Hence, establishing hyperbolicity criteria for graphs will be of interest to us.…”
Abstract. 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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.