Eccentricity terrain of δ-hyperbolic graphs
Heather Guarnera2020, Journal of Computer and System Sciences
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
A graph G = (V, E) is δ-hyperbolic if for any four vertices u, v, w, x, the two larger of the three distance sums d(u, v) + d(w, x), d(u, w) + d(v, x), d(u, x) + d(v, w) differ by at most 2δ ≥ 0. This paper describes the eccentricity terrain of a δ-hyperbolic graph. The eccentricity function e G (v) = max{d(v, u) : u ∈ V } partitions vertices of G into eccentricity layers C k (G) = {v ∈ V : e G (v) = rad(G) + k}, k ∈ N, where rad(G) = min{e G (v) : v ∈ V } is the radius of G. The paper studies the eccentricity layers of vertices along shortest paths, identifying such terrain features as hills, plains, valleys, terraces, and plateaus. It introduces the notion of β-pseudoconvexity, which implies Gromov's-quasiconvexity, and illustrates the abundance of pseudoconvex sets in δ-hyperbolic graphs. It shows that all sets C ≤k (G) = {v ∈ V : e G (v) ≤ rad(G) + k}, k ∈ N, are (2δ − 1)-pseudoconvex. Several bounds on the eccentricity of a vertex are obtained which yield a few approaches to efficiently approximating all eccentricities.
Related papers
Results on hyperbolicity in graphs: a survey
2020
Let X be a geodesic metric space, and take x1, x2, x3 ∈ X. A geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is said to be δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X. If X is hyperbolic, we denote by δ(X) the sharp hyperbolicity constant of X, that is, δ(X) := sup{δ(T ) : T is a geodesic triangle in X }. In this paper, we collect some of the main theoretical results on the hyperbolicity constant in graphs.
Distance Labeling in Hyperbolic Graphs
2005
A graph G is δ-hyperbolic if for any four vertices u,v,x,y of G the two larger of the three distance sums d G (u,v) + d G (x,y), d G (u,x) + d G (v,y), d G (u,y) + d G (v,x) differ by at most δ, and the smallest δ ≥ 0 for which G is δ-hyperbolic is called the hyperbolicity of G. In this paper, we construct a distance labeling scheme for bounded hyperbolicity graphs, that is a vertex labeling such that the distance between any two vertices of G can be estimated from their labels, without any other source of information. More precisely, our scheme assigns labels of O(log2 n) bits for bounded hyperbolicity graphs with n vertices such that distances can be approximated within an additive error of O(log n). The label length is optimal for every additive error up to n ε . We also show a lower bound of Ω(log log n) on the approximation factor, namely every s-multiplicative approximate distance labeling scheme on bounded hyperbolicity graphs with polylogarithmic labels requires s = Ω(log log n).
Gromov hyperbolicity of planar graphs
Open Mathematics, 2013
We prove that under appropriate assumptions adding or removing an infinite amount of edges to a given planar graph preserves its non-hyperbolicity, a result which is shown to be false in general. In particular, we make a conjecture that every tessellation graph of R 2 with convex tiles is non-hyperbolic; it is shown that in order to prove this conjecture it suffices to consider tessellation graphs of R 2 such that every tile is a triangle and a partial answer to this question is given. A weaker version of this conjecture stating that every tessellation graph of R 2 with rectangular tiles is non-hyperbolic is given and partially answered. If this conjecture were true, many tessellation graphs of R 2 with tiles which are parallelograms would be non-hyperbolic.
Hyperbolic Bridged Graphs
European Journal of Combinatorics, 2002
Given a connected graph G, we take, as usual, the distance xy between any two verticesx , y of G to be the length of some geodesic between x and y. The graph G is said to be δ - hyperbolic, for some δ ≥ 0, if for all vertices x,y , u, v in G the inequality holds, and G isbridged if it contains no finite isometric cycles of length four or more. In this paper, we will show that a finite connected bridged graph is 1-hyperbolic if and only if it does not contain any of a list of six graphs as an isometric subgraph.
Distortion of the Hyperbolicity Constant of a Graph
2012
If X is a geodesic metric space and x 1 , x 2 , x 3 ∈ X, a geodesic triangle T = {x 1 , x 2 , x 3 } is the union of the three geodesics [x 1 x 2 ], [x 2 x 3 ] and [x 3 x 1 ] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δneighborhood of the union of the other two sides, for every geodesic triangle T in X. We denote by δ(X) the sharp hyperbolicity constant of X, i.e., δ(X) := inf{δ ≥ 0 : X is δ-hyperbolic }. 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. One of the main aims of this paper is to obtain quantitative information about the distortion of the hyperbolicity constant of the graph G \ e obtained from the graph G by deleting an arbitrary edge e from it. These inequalities allow to obtain the other main result of this paper, which characterizes in a quantitative way the hyperbolicity of any graph in terms of local hyperbolicity.
New inequalities on the hyperbolicity constant of line graphs
Ars Combinatoria -Waterloo then Winnipeg-
If $X$ is a geodesic metric space and $x_1, x_2, x_3 \in X$, a geodesic triangle $T =\ {x_1, x_2, x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-hyperbolic (in the Gromov sense) if any side of $T$ is contained in a $\delta$-neighborhood of the union of the two other sides, for every geodesic triangle $T$ in $X$. We denote by $\delta(X)$ the sharp hyperbolicity constant of $X$, i.e. $\delta(X) := \inf \{ \delta ≥ 0 : X \text{ is } \delta- \text{hyperbolic} \}$. The main result of this paper is the inequality $\delta(G) ≤ \delta(L(G))$ for the line graph $L(G)$ of every graph $G$. We prove also the upper bound $\delta(L(G)) ≤ 5 \delta(G) + 3 l_{max}$, where $l_{max}$ is the supremum of the lengths of the edges of $G$. Furthermore, if every edge of $G$ has length $k$, we obtain $\delta(G) ≤ \delta(L(G)) ≤ 5 \delta(G) + 5 k/2$.
Gromov hyperbolic cubic graphs
Central European Journal of Mathematics, 2012
If X is a geodesic metric space and 1 2 3 ∈ X , a geodesic triangle T = { 1 2 3 } is the union of the three geodesics [ 1 2 ], [ 2 3 ] and [ 3 1 ] in X . The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X . We denote by δ(X ) the sharp hyperbolicity constant of X , i.e., δ(X ) = inf {δ ≥ 0 : X is δ-hyperbolic}. We obtain information about the hyperbolicity constant of cubic graphs (graphs with all of their vertices of degree 3), and prove that for any graph G with bounded degree there exists a cubic graph G * such that G is hyperbolic if and only if G * is hyperbolic. Moreover, we prove that for any cubic graph G with vertices, we have δ(G) ≤ min {3 /16 + 1 /4}. We characterize the cubic graphs G with δ(G) ≤ 1. Besides, we prove some inequalities involving the hyperbolicity constant and other parameters for cubic graphs.
Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
Electronic Notes in Discrete Mathematics, 2008
We present simple methods for approximating the diameters, radii, and centers of finite sets in δ-hyperbolic geodesic spaces and graphs. We also provide a simple construction of distance approximating trees of δ-hyperbolic graphs G on n vertices with an additive error O(δ log 2 n) comparable with that given by M. Gromov.
On the contour of graphs
Discrete Applied Mathematics, 2013
Let G = (V, E) be a finite, simple and connected graph. Let S ⊆ V , its closed interval I[S] is the set of all vertices lying on a shortest path between any pair of vertices of S. The set S is geodetic if I[S] = V . The eccentricity of a vertex v is the number of edges in the greatest shortest path between v and any vertex w of G. The contour Ct(G) of G is the set formed by vertices v such that no neighbor of v has an eccentricity greater than v. We consider the problem of determining whether the contour of a graph class is geodetic. The diameter diam(G) of G is the maximum eccentricity of the vertices in V . In this work we establish a relation between the diameter and the geodeticity of the contour of a graph. We prove that the contour is geodetic for graphs with diameter k ≤ 4. Furthermore, for every k > 4, there is a graph with diameter k and whose contour is not geodetic. We show that the contour is geodetic for bipartite graphs with diameter k ≤ 7, and for any k > 7 there is a bipartite graph with diameter k and non-geodetic contour. By applying these results, we solve the open problems mentioned by Cáceres et al. namely to decide whether the contour of cochordal graph, parity graph and bipartite graphs are geodetic.
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs
Lecture Notes in Computer Science, 2021
A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. The class of Helly graphs is the discrete analogue of the class of hyperconvex metric spaces. It is also known that every graph isometrically embeds into a Helly graph, making the latter an important class of graphs in Metric Graph Theory. We study diameter, radius and all eccentricity computations within the Helly graphs. Under plausible complexity assumptions, neither the diameter nor the radius can be computed in truly subquadratic time on general graphs. In contrast to these negative results, it was recently shown that the radius and the diameter of an n-vertex m-edge Helly graph G can be computed with high probability inÕ(m √ n) time (i.e., subquadratic in n + m). In this paper, we improve that result by presenting a deterministic O(m √ n) time algorithm which computes not only the radius and the diameter but also all vertex eccentricities in a Helly graph. Furthermore, we give a parameterized linear-time algorithm for this problem on Helly graphs, with the parameter being the Gromov hyperbolicity δ. More specifically, we show that the radius and a central vertex of an m-edge δ-hyperbolic Helly graph G can be computed in O(δm) time and that all vertex eccentricities in G can be computed in O(δ 2 m) time. To show this more general result, we heavily use our new structural properties obtained for Helly graphs.
Related papers
On the Hyperbolicity Constant of Line Graphs
The electronic journal of combinatorics
The main aim of this paper is to obtain information about the hyperbolicity constant of the line graph L(G) in terms of parameters of the graph G. In particular, we prove qualitative results as the following: a graph G is hyperbolic if and only if L(G) is hyperbolic; if {Gn} is a T-decomposition of G ({Gn} are simple subgraphs of G), the line graph L(G) is hyperbolic if and only if supnδ(L(Gn)) is finite. Besides, we obtain quantitative results. Two of them are quantitative versions of our qualitative results. We also prove that g(G)/4≤δ(L(G))≤c(G)/4+2, where g(G) is the girth of G and c(G) is its circumference. We show that δ(L(G))≥sup{L(g):g is an isometric cycle in G}/4. Furthermore, we characterize the graphs G with δ(L(G))<1.
Hyperbolicity and complement of graphs
Applied Mathematics Letters, 2011
If X is a geodesic metric space and x 1 ,
Mathematical Properties on the Hyperbolicity of Interval Graphs
Symmetry
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.
Diameter, minimum degree and hyperbolicity constant in graphs
Electronic Notes in Discrete Mathematics, 2016
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). Since computing the hyperbolicity constant is an almost intractable problem, 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 δ 0 . We study a(n, δ 0 ) := min{δ(G) | G ∈ H(n, δ 0 )} and b(n, δ 0 ) := max{δ(G) | G ∈
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the Twenty Fourth Annual Symposium on Computational Geometry, 2008
We present simple methods for approximating the diameters, radii, and centers of finite sets in δ-hyperbolic geodesic spaces and graphs. We also provide a simple construction of distance approximating trees of δ-hyperbolic graphs G on n vertices with an additive error O(δ log 2 n) comparable with that given by M. Gromov.
Chordality Properties and Hyperbolicity on Graphs
The Electronic Journal of Combinatorics, 2016
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if every induced cycle has at most three edges. In this paper we study the relation between the hyperbolicity of the graph and some chordality properties which are natural generalizations of being chordal. We find chordality properties that are weaker and stronger than being $\delta$-hyperbolic. Moreover, we obtain a characterization of being hyperbolic on terms of a chordality property on the triangles.
Gromov hyperbolicity of minor graphs
If $X$ is a geodesic metric space and $x_1,x_2,x_3\in X$, a geodesic triangle $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-hyperbolic (in the Gromov sense) if any side of $T$ is contained in a $\delta$-neighborhood of the union of the two other sides, for every geodesic triangle $T$ in $X$. 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. In the context of graphs, to remove and to contract an edge of a graph are natural transformations. The main aim in this work is to obtain quantitative information about the distortion of the hyperbolicity constant of the graph $G \setminus e$ (respectively, $\,G/e\,$) obtained from the graph $G$ by deleting (respectively, contracting) an arbitrary edge $e$ from it. This work provides information about the hyperbolicity constant of minor graphs.
On the hyperbolicity of edge-chordal and path-chordal graphs
Filomat
In this paper we find a very close connection between hyperbolicity and chordality: we extend the classical definition of chordality in two ways, edge-chordality and path-chordality, in order to relate this property with Gromov hyperbolicity. In fact, we prove that every edge-chordal graph is hyperbolic and that every hyperbolic graph is path-chordal. Furthermore, we prove that every path-chordal cubic graph with small path-chordality constant is hyperbolic.
Small values of the hyperbolicity constant in graphs
Discrete Mathematics, 2016
Note that, if we consider a graph G whose edges have length equal to one and a graph G k obtained from G stretching out their edges until length k, then δ(G k) = kδ(G). Therefore, all the results in this work can be generalized when the edges of the graph have length equal to k.
On the hyperbolicity constant of circular-arc graphs
2020
Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. It measures the tree-likeness of a graph from a metric viewpoint. In particular, we are interested in circular-arc graphs, which is an important class of geometric intersection graphs. In this paper we give sharp bounds for the hyperbolicity constant of (finite and infinite) circular-arc graphs. Moreover, we obtain bounds for the hyperbolicity constant of the complement and line of any circular-arc graph. In order to do that, we obtain new results about regular, chordal and line graphs which are interesting by themselves.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.