Next Article in Journal
Testing Lorentz Symmetry Using High Energy Astrophysics Observations
Next Article in Special Issue
β-Differential of a Graph
Previous Article in Journal
A Generalization of Trapezoidal Fuzzy Numbers Based on Modal Interval Theory
Previous Article in Special Issue
Gromov Hyperbolicity in Mycielskian Graphs

Symmetry 2017, 9(10), 199; https://doi.org/10.3390/sym9100199

Article
Generalized Chordality, Vertex Separators and Hyperbolicity on Graphs
Department of Economic analysis and Finances, Universidad de Castilla-La Mancha, Avda. Real Fábrica de Sedas s/n, 45600 Talavera de la Reina, Spain
Received: 21 August 2017 / Accepted: 19 September 2017 / Published: 24 September 2017

## Abstract

:
A graph is chordal if every induced cycle has exactly three edges. A vertex separator set in a graph is a set of vertices that disconnects two vertices. A graph is $δ$-hyperbolic if every geodesic triangle is $δ$-thin. In this paper, we study the relation between vertex separator sets, certain chordality properties that generalize being chordal and the hyperbolicity of the graph. We also give a characterization of being quasi-isometric to a tree in terms of chordality and prove that this condition also characterizes being hyperbolic, when restricted to triangles, and having stable geodesics, when restricted to bigons.
Keywords:
infinite graph; geodesic; Gromov hyperbolic; chordal; bottleneck property; vertex separator

## 1. Introduction

M. Gromov defined in  his notion of hyperbolicity for the study of finitely-generated groups. Since then, Gromov hyperbolic spaces have been studied from a geometric point of view providing a wide variety of results and making them an important subclass of metric spaces [2,3,4,5,6]. In particular, Gromov hyperbolicity is an important property to be studied in graphs [7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25]. Gromov hyperbolicity has found also interesting applications in phylogenetics [26,27], complex networks [28,29,30,31], virus propagation and secure transmission of information [32,33] and congestion in hyperbolic networks .
Given a metric space $( X , d )$ and two points $x , y ∈ X$, a geodesic from x to y is an isometry, $γ : [ 0 , l ] → X$, from a closed interval $[ 0 , l ]$ of the real line to X such that $γ ( 0 ) = x$ and $γ ( l ) = y$. We will make no distinction between the geodesic and its image. X is a geodesic metric space if for every pair of points $x , y ∈ X$, there is some geodesic joining x to y. Although geodesics need not be unique, for convenience, $[ x y ]$ will denote any such geodesic.
Herein, we consider the graphs always endowed with the usual length metric where every edge has length one. Thus, for any pair of points in G, the distance between them will be the length of the shortest path in G joining them. Notice that we are considering also the interior points of the edges as points in G. Therefore, G with the length metric is a geodesic metric space. Let us also assume that the graphs are connected.
Gromov hyperbolicity, in the context of geodesic metric spaces, can be characterized by the Rips condition as follows. If X is a geodesic metric space and $x 1 , x 2 , x 3 ∈ X$, the union of three geodesics $[ x 1 x 2 ]$, $[ x 2 x 3 ]$ and $[ x 3 x 1 ]$ is called a geodesic triangle and will be denoted by $T = { x 1 , x 2 , x 3 }$. If two vertices are identical then it is called a bigon. A triangle T is $δ$-thin if any side of T is contained in the $δ$-neighborhood of the union of the two other sides. A geodesic metric space X is $δ$-hyperbolic if every geodesic triangle is $δ$-thin. By $δ ( X )$, we denote the sharp hyperbolicity constant of X, this is, $δ ( X ) : = inf { δ | every triangle in X is δ - thin } .$ A metric space X is hyperbolic if it is $δ$-hyperbolic for some $δ ≥ 0$. There exist other equivalent definitions of Gromov hyperbolicity. See .
A graph G is said to be chordal if every induced cycle has exactly three edges. Chordal graphs form an important subclass of perfect graphs, and as is pointed out in  (see the further references therein), they have applications in scheduling, Gaussian elimination on sparse matrices and relational database systems. Furthermore, chordal graphs have applications in computer science; see . In , it is proved that chordal graphs are hyperbolic. Wu and Zhang extended this result in  proving that k-chordal graphs are hyperbolic where a graph is k-chordal if induced cycles have at most k edges. In , the authors defined some more natural generalizations of being chordal as being $( k , m )$-edge-chordal and $( k , k 2 )$-path-chordal proving that $( k , m )$-edge-chordal graphs are hyperbolic and that hyperbolic graphs are $( k , k 2 )$-path-chordal. In , we continue this work and define being $ε$-densely $( k , m )$-path-chordal and $ε$-densely k-path-chordal. In [39,40], edges were allowed to have any finite length, but in this work, we assume that all edges have length one. Therefore, the distinction between edge and path is unnecessary, and these properties are referred as $( k , m )$-chordal and $ε$-densely k-chordal. The main results in  (with this simplified notation) state that:
$( k , 1 ) - chordal ⇒ ε - densely ( k , m ) - chordal ⇒ δ - hyperbolic$
and:
$δ - hyperbolic ⇒ ε - densely k - chordal ⇒ k - chordal .$
We also proved that the converse is false for all these implications, giving counterexamples, and that a graph is hyperbolic if and only if certain chordality property is satisfied on the triangles.
Herein, we continue this study analyzing some relations between these properties and vertex separators. There are some well-known relations between chordality and vertex separators. For example, Dirac proved in  that a graph is chordal if and only if every minimal vertex separator is complete. Furthermore, the set of minimal vertex separators of a chordal graph allows one to decompose the graph into subgraphs that are again chordal, and the process can be continued until the subgraphs are cliques . Generalized versions of chordality are also related to minimal vertex separator . For further results about chordality and vertex separators, see also  and the references therein. For an important application of minimal vertex separators in machine learning, see . Our main results are the following.
In Section 2, we prove that being $( k , 1 )$-chordal implies that every minimal vertex separator has a uniformly-bounded diameter. We also obtain that, for uniform graphs, if every minimal vertex separator has a uniformly-bounded diameter, then the graph is $ε$-densely $( k , m )$-chordal and therefore hyperbolic.
Section 3 studies the relation between generalized chordality and the bottleneck property, which is an important property on hyperbolic geodesic spaces. J. Manning defined it in  and proved that a geodesic metric space satisfies bottleneck property, (BP), if and only if it is quasi-isometric to a tree. This characterization has proven to be very useful; see for example . For some other relations with (BP), see [46,47] and the references therein.
Here, we prove that a graph satisfies (BP) if and only if it is $ε$-densely $( k , m )$-chordal, providing a characterization of being quasi-isometric to a tree in terms of chordality. Furthermore, the characterization of hyperbolicity from  is re-written obtaining that a graph is hyperbolic if and only if it is $ε$-densely $( k , m )$-chordal on the cycles that are geodesic triangles.
Furthermore, we prove that if G is a uniform graph and every minimal vertex separator has a uniformly-bounded diameter, then the graph satisfies (BP), and therefore, it is quasi-isometric to a tree. Finally, we prove directly that being $( k , 1 )$-chordal implies (BP) .
In Section 4, we generalize the concept of vertex separators defining vertex r-separators. It is proven that if, in a uniform graph, all minimal vertex r-separators have a uniformly-bounded diameter, then the graph is $ε$-densely $( k , m )$-chordal and, therefore, quasi-isometric to a tree.
Section 5 introduces neighbor separators, generalizing also vertex separators. This concept allows one to characterize (BP) in terms of having a neighbor-separator vertex.
In Section 6, we define neighbor obstructors. We use them to characterize the graphs where geodesics between vertices are stable and to prove that geodesics between vertices are stable if and only if the graph is $ε$-densely $( k , m )$-chordal on the bigons defined by two vertices. We also prove that, in general, geodesics are stable if and only if the graph is $ε$-densely $( k , m )$-chordal on the bigons.

## 2. Generalized Chordality and Minimal Vertex Separators

We are assuming that every path is finite and simple, that is, it has finite length and distinct vertices. By a cycle, we mean a simple closed curve, that is, a path where all the vertices are different except from the first one and the last one, which are the same.
Let $γ$ be a path or a cycle. A shortcut in $γ$ is a path $σ$ joining two vertices $p , q$ in $γ$ such that $L ( σ ) < d γ ( p , q )$ where $L ( σ )$ denotes the length of the path $σ$ and $d γ$ denotes the length metric on $γ$. A shortcut $σ$ in $γ$ is strict if $σ ∩ γ = { p , q }$. In this case, we say that p, q are shortcut vertices in $γ$ associated with $σ$. A shortcut with length k is called a k-shortcut.
Remark 1.
Suppose σ is a k-shortcut in a cycle C joining two vertices, $p , q$. Then, σ contains a strict shortcut, and there are two shortcut vertices $p ′ , q ′$ such that $d C ( p , p ′ ) , d C ( q , q ′ ) < k$.
Definition 1.
A metric graph G is k-chordal if for any cycle C in G with $L ( C ) ≥ k$, there exists a shortcut σ of C.
Definition 2.
A metric graph G is $( k , m )$-chordal if for any cycle C in G with $L ( C ) ≥ k$, there exists a shortcut σ of C such that $L ( σ ) ≤ m$. Notice that being chordal is equivalent to being $( 4 , 1 )$-chordal.
Remark 2.
Notice that in the definitions of k-chordal and $( k , m )$-chordal, it makes no sense to consider $k ≤ 3$ nor $k < 2$m. Therefore, let us assume always that $k ≥ 4$ and $k ≥ 2$m.
Definition 3.
A subset $S ⊂ V ( G )$ is a separator if $G \ S$ has at least two connected components. Two vertices a and b are separated by S if they are in different connected components of $G \ S$. If a and b are two vertices separated by S, then S is said to be an $a b$-separator.
Let us call a path joining the vertices $a , b$ an $a b$-path.
Definition 4.
S is a minimal separator if no proper subset of S is a separator. Similarly, S is a minimal $a b$-separator if no proper subset of S separates a and b. Finally, S is a minimal vertex separator if it is a minimal separator for some pair of vertices.
Note that being a minimal vertex separator does not imply being a minimal separator. See Figure 1.
Remark 3.
Let S be a minimal $a b$-separator, and let $G a$, $G b$ be the connected components of $G \ S$ containing a and b, respectively. Then, notice that every vertex v in S is adjacent to both $G a$ and $G b$. Otherwise, $S \ { v }$ is an $a b$-separator.
Proposition 1.
If G is $( k , 1 )$-chordal, then every minimal vertex separator has a diameter less than $k 2$.
Proof.
Let S be a minimal $a b$-separator, and suppose that $d i a m ( S ) ≥ k 2$. Let $x , y ∈ S$ such that $d ( x , y ) ≥ k 2$. Then, there are vertices $a 1 , a n$ in $G a$ adjacent to x and y respectively, and since $G a$ is connected, there is a path $γ 1 = { x , a 1 , … , a n , y }$ with $a i ∈ G a ∀ 1 ≤ i ≤ n$. Similarly, there exist vertices $b 1 , b m$ in $G b$ adjacent to y and x respectively and a path $γ 2 = { y , b 1 , … , b m , x }$ with $b i ∈ G b ∀ 1 ≤ i ≤ m$. Moreover, let us assume that $γ 1 , γ 2$ have minimal length. Then, $C = γ 1 ∪ γ 2$ defines a cycle in G, and since $d ( x , y ) ≥ k 2$, $L ( C ) ≥ k$. Then, since G is $( k , 1 )$-chordal, there is a shortcut $σ$ in C with $L ( σ ) = 1$. However, since S is an $a b$-separator, vertices in $G a$ and $G b$ cannot be adjacent, and since $γ 1 , γ 2$ are supposed minimal, there is no possible one-shortcut on $γ i$ for $i = 1 , 2$. Thus, $x , y$ need to be adjacent, leading to a contradiction. ☐
The converse is not true.
Example 1.
Consider the graph $G 0$ whose vertices are $V ( G 0 ) = { n ∈ N | n ≥ 3 }$ and edges joining consecutive numbers. Now, let us define the graph G such that for every $n ≥ 3$, there is cycle $C n$ whose vertices are all adjacent to the vertex n in $G 0$. See Figure 2.
It is trivial to check that G is not $( k , 1 )$-chordal for any $k > 0$ since the cycles $C n$ have no one-shortcut in G.
Let us see that every minimal vertex separator has diameter at most two. Consider any pair of non-adjacent vertices $a , b$ in G.
If $a , b ∈ C n$ for some n, then every vertex separator S must contain the vertex n and at least two vertices $x 1 , x 2$ in $C n$. If S is minimal, then $S = { n , x 1 , x 2 }$ and $d i a m ( S ) = 2$.
If $a , b ∉ C n$ for any n, then the geodesic $[ a b ]$ is contained in $G 0$. Therefore, any $a b$-separator must contain some vertex $m ∈ [ a b ]$ and m separates a and b. Thus, if S is minimal, then S is just a vertex and $d i a m ( S ) = 0$.
Remark 4.
Given two vertices $a , b$, a path γ joining them and a vertex $v ∈ γ$ distinct from $a , b$, there may not exist a minimal $a b$-separator containing ${ v }$. Consider, for example four vertices $x 0 , x 1 , x 2 , x 3$ with edges $x i − 1 x i$ for every $1 ≤ i ≤ 3$ and an edge $x 0 x 2$. Then, there is no minimal $x 0 x 3$-separator containing $x 1$.
Given a graph G and a subgraph, $A ⊂ G$, let us denote $V ( A )$ the vertices in A.
Definition 5.
A graph Γ is said to be μ-uniform if each vertex p of V has at most μ neighbors, i.e.,
$sup | N ( p ) | | p ∈ V ( Γ ) ≤ μ .$
If a graph Γ is μ-uniform for some constant μ, we say that Γ is uniform.
For any vertex $v ∈ V ( G )$ and any constant $ε > 0$, let us denote:
$S ε ( v ) : = { w ∈ V ( G ) | d ( v , w ) = ε } ,$
$B ε ( v ) : = { w ∈ V ( G ) | d ( v , w ) < ε } ,$
$N ε ( v ) : = { w ∈ V ( G ) | d ( v , w ) ≤ ε } .$
Lemma 1.
Let G be a uniform graph. Given two vertices $a , b$, a geodesic $[ a b ]$ joining them and a vertex $v 0 ∈ [ a b ]$ distinct from $a , b$, then there is a minimal $a b$-separator containing ${ v 0 }$.
Proof.
Suppose any geodesic $[ a b ]$ and $v 0 ∈ [ a b ]$ with $0 < d ( a , v 0 ) < d ( a , b )$, and define $ε = d ( a , v 0 )$. Since G is uniform, for every vertex $v ∈ G$, the set $S 0 : = S ( v , ε )$ is finite for every $ε ∈ N$. It is immediate to check that $S 0$ is an $a b$-separator and $[ a b ] ∩ S 0 = { v 0 }$. Since $S 0$ is finite, then there is a minimal subset $S ⊂ S 0$ that is also an $a b$-separator. Finally, since $[ a b ] ∩ S 0 = { v 0 }$, $v 0 ∈ S$. ☐
Let us recall that a graph $Γ$ is countable if $| V ( Γ ) | ≤ ℵ 0$, i.e., if it has a countable number of vertices.
Remark 5.
In the case of countable graphs and using the axiom of choice, Lemma 1 can be slightly improved. See Lemma 2 below.
Lemma 2.
Let G be a uniform countable graph. Given two vertices $a , b$, a path $γ 0$ joining them and a vertex $v 0 ∈ γ 0$ distinct from $a , b$, then either there is a one-shortcut in $γ 0$ or there is a minimal $a b$-separator containing ${ v 0 }$.
Proof.
If there is no $a b$-path in $G \ { v 0 }$, it suffices to consider $S : = { v 0 }$. If there is an $a b$-path $γ 1$ in $G \ { v 0 }$ such that $V ( γ 1 ) ⊂ V ( γ 0 )$, then there is a one-shortcut in $γ 0$. Thus, let us suppose that every $a b$-path $γ$ in $G \ { v 0 }$ contains a vertex, which is not in $γ 0$, and that there is at least one of these $a b$-paths.
Since $| V ( G ) |$ is countable and G is uniform, there exist at most $ℵ 0 k$ $a b$-paths of length k. Then, there exists at most a countable number (a countable union of countable sets) of $a b$-paths, ${ γ i } i ∈ I ⊂ N$ in $G \ { v 0 }$ where $I = { 1 , ⋯ , m }$ if there exist exactly m such paths or $I = N$ if the number of those paths is not finite.
For every $i ∈ I$, consider some vertex $x i$ in $V ( γ i ) \ V ( γ 0 )$, and let $X = { x i } i ∈ I$. Now, let $S 0 : = X$, and for every $0 < i ∈ I$, define:
Notice that for every i, $S i ⊂ S i − 1$, and let $S : = ∩ i ∈ I S i$.
Claim: S is a minimal $a b$-separator containing $v 0$.
First, let us see that S is an $a b$-separator. Consider any $a b$-path, $γ j$. Suppose $V ( γ j ) ∩ X = { x j 1 , x j 2 , … , x j k }$, and assume $j l < j k$ for every $l < k$. Then, it is trivial to check that there exist some vertex $x j r ∈ S j k ∩ V ( γ j )$ and, by construction, $x j r ∈ S$.
To check that S is minimal, first notice that, since $x i ∉ V ( γ 0 )$ for every $i ∈ I$, $V ( γ 0 ) ∩ ( S \ { v 0 } ) = ∅$ and $S \ { v 0 }$ is not an $a b$-separator. Now, suppose that there is some vertex $x j ∈ S$ with $j ∈ I$ such that $S \ { x j }$ is also an $a b$-separator. Since $x j ∈ S ⊂ S j$, there is some $k ≤ j$ such that $V ( γ k ) ∩ S j − 1 \ { x j } = ∅$ and, in particular, $V ( γ k ) ∩ S \ { x j } = ∅$, leading to a contradiction. Thus, S is a minimal $a b$-separator containing $v 0$. ☐
Given a metric space $( X , d )$ and any $ε > 0$, a subset $A ⊂ X$ is $ε$-dense if for every $x ∈ X$, there exists some $a ∈ A$ such that $d ( a , x ) < ε$.
Definition 6.
A metric graph $( G , d )$ is ε-densely k-chordal if for every cycle C with length $L ( C ) ≥ k$, there exist strict shortcuts $σ 1 , … , σ r$ such that their associated shortcut vertices define an ε-dense subset in $( C , d C )$.
Definition 7.
A graph $( G , d )$ is ε-densely $( k , m )$-chordal if for every cycle C with length $L ( C ) ≥ k$, there exist strict shortcuts $σ 1 , … , σ r$ with $L ( σ i ) ≤ m$$∀ i$ and such that their associated shortcut vertices define an ε-dense subset in $( C , d C )$.
Theorem 1.
Let G be a uniform graph. If every minimal vertex separator in G has diameter at most m, then G is $( m + ϵ )$-densely $( 4 m , 2 m − 1 )$-chordal for any $ϵ > 1 2$.
Proof.
Let C be any cycle with $L ( C ) ≥ 4 m$. Let v be any vertex in C, and let $a , b$ be the two vertices in C such that $d C ( a , v ) = m = d C ( v , b )$. Let $γ 0$ be the $a b$-path in C containing v. Then, by Lemma 1, either there is a shortcut in $γ 0$ or there is a minimal $a b$-separator containing v.
If there is a shortcut in $γ 0$, then it has length at most $2 m − 1$. Therefore, it defines a shortcut in C with an associated shortcut vertex $v ′$ such that $d C ( v , v ′ ) ≤ m$. Suppose, otherwise, that S is a minimal $a b$-separator containing v. By hypothesis, $d i a m ( S ) ≤ m$. Let $γ 1$ be the $a b$-path in C not containing v. Since S is an $a b$-separator, there is some vertex $w ∈ S ∩ V ( γ 1 )$ and $d ( v , w ) ≤ m < d C ( v , w )$. Hence, there is an m-shortcut in C joining v to w and, by Remark 1, an associated shortcut vertex $v ′$ such that $d C ( v , v ′ ) < m$.
Thus, for every vertex v, there is a shortcut vertex $v ′$ such that $d C ( v , v ′ ) ≤ m$, and therefore, shortcut vertices define a $( m + ϵ )$-dense subset in C for any $ε > 1 2$. ☐
If the graph is countable, then we can improve quantitatively this result.
Theorem 2.
Let G be a uniform countable graph. If every minimal vertex separator in G has diameter at most m, then G is $( m + ϵ )$-densely $( 2 m + 2 , m )$-chordal for any $ϵ > 1 2$.
Proof.
Let C be any cycle with $L ( C ) ≥ 2 m + 2$. Let v be any vertex in C, and let $a , b$ be the two vertices in C such that $d C ( a , v ) = m = d C ( v , b )$. Let $γ 0$ be the $a b$-path in C containing v. Then, by Lemma 2, either there is a one-shortcut in $γ 0$ or there is a minimal $a b$-separator containing v.
If there is a one-shortcut in $γ 0$, then, in particular, there is an associated shortcut vertex $v ′$ such that $d C ( v , v ′ ) ≤ m$. Suppose, otherwise, that S is a minimal $a b$-separator containing v. By hypothesis, $d i a m ( S ) ≤ m$. Let $γ 1$ be the $a b$-path in C not containing v. Since S is an $a b$-separator, there is some vertex $w ∈ S ∩ V ( γ 1 )$ and $d ( v , w ) ≤ m < d C ( v , w )$. Hence, there is an m-shortcut in C joining v to w and, by Remark 1, an associated shortcut vertex $v ′$ such that $d C ( v , v ′ ) < m$.
Thus, for every vertex v, there is a shortcut vertex $v ′$ such that $d C ( v , v ′ ) ≤ m$, and therefore, shortcut vertices define a $( m + ϵ )$-dense subset in C for any $ε > 1 2$. ☐
Let us recall the following result:
Theorem 3.
(Theorem 4 ). If G is ε-densely $( k , m )$-chordal, then G is hyperbolic. Moreover, $δ ( G ) ≤ max { k 4 , ε + m }$.
Therefore, from Theorems 1–3, we obtain:
Corollary 1.
Let G be a uniform graph. If every minimal vertex separator in G has diameter at most m, then G is hyperbolic. Moreover, $δ ( G ) ≤ 3 m − 1 2$.
Corollary 2.
Let G be a uniform countable graph. If every minimal vertex separator in G has diameter at most m, then G is hyperbolic. Moreover, $δ ( G ) ≤ 2 m + 1 2$.

## 3. Bottleneck Property

Let us recall the following definition from :
Definition 8.
A geodesic metric space $( X , d )$ satisfies the bottleneck property (BP) if there exists some constant $Δ > 0$ so that given any two distinct points $x , y ∈ X$ and a midpoint z such that $d ( x , z ) = d ( z , y ) = 1 2 d ( x , y )$, then every $x y$-path intersects $N Δ ( z )$.
Remark 6.
This definition, although not being exactly the same, is equivalent to Manning’s. In the original definition, J. Manning asked only for the existence of such a midpoint for any pair of points $x , y$. However, by Theorem 4 below, (BP) implies that the space is quasi-isometric to a tree and therefore δ-hyperbolic. Hence, it is an easy exercise in hyperbolic spaces to prove that if there is always a midpoint z such that every $x y$-path intersects $N Δ ( z )$, then this condition holds in general for any midpoint, possibly with a different constant depending only on Δ and δ. See, for example, Chapter 2, Proposition 25 in .
Definition 9.
A graph G satisfies (BP) on the vertices if there exists some constant $Δ ′ > 0$ so that given any two distinct vertices $v , w ∈ V ( G )$ and a midpoint c such that $d ( v , c ) = d ( c , w ) = 1 2 d ( v , w )$, then every $v w$-path intersects $N Δ ′ ( c )$.
Proposition 2.
A graph G satisfies (BP) if and only if it satisfies (BP) on the vertices. Moreover, if G satisfies (BP) on the vertices with constant $Δ ′$, it satisfies (BP) with $Δ = Δ ′ + 3 2$.
Proof.
The only if condition is trivial. Let us see that it suffices to check the property on the pairs of vertices.
Consider any pair of points $x , y ∈ G$, and let z be a midpoint of a geodesic $[ x y ]$. If $d ( x , y ) ≤ 2$, then (BP) is trivial with $Δ = 1$. Suppose $d ( x , y ) > 2$. Then, the geodesic $[ x y ]$ is a path $x v 1 ∪ v 1 v 2 ∪ ⋯ ∪ v k y$ with $v 1 , ⋯ , v k ∈ V ( G )$ and $k ≥ 2$. Let $v = x$ if x is a vertex and $v = v 1$ otherwise, and let $w = y$ if y is a vertex and $w = v k$ otherwise. Then, there is a geodesic $[ v w ] ⊂ [ x y ]$ (possibly equal), and its midpoint, c, satisfies that $d ( c , z ) ≤ 1 2$.
Consider any $x y$-path $γ$, and let us define a $v w$-path $γ ′$ as follows: First, if $v ∈ γ$, let $γ 0 : = γ \ [ x v ]$ and if $v ∉ γ$, let $γ 0 : = [ v x ] ∪ γ$.
Then, if $y ≠ w$ and $w ∈ γ$, let $γ ′ : = γ 0 \ [ y w ]$ and if $y ≠ w$ and $w ∉ γ$, let $γ ′ : = [ w y ] ∪ γ 0$. By hypothesis, $γ ′$ passes through $N Δ ′ ( c )$. Since $d ( a , v ) , d ( b , w ) ≤ 1$ and $d ( c , z ) ≤ 1 2$, it is immediate to check that $γ$ passes through $N Δ ′ + 3 2 ( z )$. ☐
A map between metric spaces, $f : ( X , d X ) → ( Y , d Y )$, is said to be a quasi-isometric embedding if there are constants $λ ≥ 1$ and $C > 0$ such that $∀ x , x ′ ∈ X$,
$1 λ d X ( x , x ′ ) − C ≤ d Y ( f ( x ) , f ( x ′ ) ) ≤ λ d X ( x , x ′ ) + C .$
If there is a constant $D > 0$ such that $∀ y ∈ Y$, $d ( y , f ( X ) ) ≤ D$, then f is a quasi-isometry, and $X , Y$ are quasi-isometric.
Theorem 4.
(Theorem 4.6 ). A geodesic metric space $( X , d )$ is quasi-isometric to a tree if and only if it satisfies (BP).
Theorem 5.
A graph G satisfies (BP) if and only if it is ε-densely $( k , m )$-chordal.
Proof.
Suppose that G satisfies (BP) with parameter $Δ$ and consider any cycle C with $L ( C ) ≥ 2 Δ + 4$. Consider any vertex $x ∈ C$ and the two vertices $a , b$ such that $d C ( a , x ) = d C ( x , b ) = Δ + 1$. Thus, C defines two $a b$-paths, $γ 1 , γ 2$. Let us assume that $x ∈ γ 1$. If $γ 1$ is not geodesic, then there is a shortcut with length at most $2 Δ + 1$ and a shortcut vertex in $N Δ + 1 ( x )$. Otherwise, since G satisfies (BP) with parameter $Δ$, there is a vertex y in $γ 2$ such that $d ( x , y ) ≤ Δ$. Since $d C ( x , y ) > Δ$ and by Remark 1, there is a shortcut vertex z such that $d C ( x , z ) < Δ$. Therefore, G is $( Δ + 1 + ε )$-densely $( 4 Δ + 4 , 2 Δ + 1 )$-chordal for any $ε > 1 2$.
Suppose that G is $ε$-densely $( k , m )$-chordal and it does not satisfy (BP) with parameter $Δ = max { k 4 , ε + m }$. Then, there are two points, $a , b$, a geodesic $[ a b ]$ with midpoint c and a path $γ$ such that $γ ∩ N Δ ( c ) = ∅$. Then, it is immediate to check that there exist two points $a ′ , b ′ ∈ γ ∩ [ a b ]$ such that the restriction of $[ a b ]$, $[ a ′ b ′ ]$, and the restriction of $γ$, $γ ′$, joining $a ′$ to $b ′$ define a cycle C with $L ( C ) > k$. Since G is $ε$-densely $( k , m )$-chordal, there is a strict shortcut $σ$ with $L ( σ ) ≤ m$ with an associated shortcut vertex w such that $d C ( c , w ) < ε < Δ$. Therefore, $w ∈ [ a ′ b ′ ]$, and since $[ a ′ b ′ ]$ is geodesic, the shortcut must join w to a vertex z in $γ ′ ⊂ γ$. Hence, $d ( z , c ) < ε + m$ and $γ ∩ N Δ ( c ) ≠ ∅$, leading to a contradiction. ☐
Corollary 3.
A graph G is quasi-isometric to a tree if and only if it is ε-densely $( k , m )$-chordal.
Definition 10.
Given any family $F$ of cycles, a metric graph $( G , d )$ is ε-densely $( k , m )$-chordal on $F$ if for every $C ∈ F$ with length $L ( C ) ≥ k$, there exist strict shortcuts $σ 1 , … , σ r$ with $L ( σ i ) ≤ m$$∀ i$ and such that their associated shortcut vertices define an ε-dense subset in $( C , d C )$.
Let us recall the following:
Lemma 3.
(Lemma 2.1 ). Let X be a geodesic metric space. If every geodesic triangle in X which is a cycle is δ-thin, then X is δ-hyperbolic.
Let $T$ be the family of cycles that are geodesic triangles. It is immediate to check that, using Lemma 3, the proof of Theorem 13 in  can be trivially re-written (we include it for completeness) to obtain the following:
Theorem 6.
G is δ-hyperbolic if and only if G is ε-densely $( k , m )$-chordal on $T$.
Proof.
Suppose that G is $ε$-densely $( k , m )$-path-chordal on $T$. Let us see that $δ ( G ) ≤ max { k 4 , ε + m }$. Consider any cycle that is a geodesic triangle $T = { x , y , z }$. If $L ( T ) < k$, it follows that every side of the triangle has length at most $k 2$. Therefore, the hyperbolic constant is at most $k 4$. Then, let $L ( T ) ≥ k$, and let us prove that T is $( ε + m )$-thin. Consider any point $p ∈ T$, and let us assume that $p ∈ [ x y ]$. If $d ( p , x ) < ε + m$ or $d ( p , y ) < ε + m$, we are done. Otherwise, there is a shortcut vertex $x i$ such that $d ( x i , p ) < ε$ and a shortcut $σ i$, with $x i ∈ σ i$ and $L ( σ i ) ≤ m$. Since $[ x y ]$ is a geodesic, $σ i$ does not connect two points in $[ x y ]$ and $d ( p , [ x z ] ∪ [ y z ] ) < ε + m$. Then, by Lemma 3, $δ ( G ) ≤ max { k 4 , ε + m }$.
Suppose that G is $δ$-hyperbolic, and consider any cycle that is a geodesic triangle $T = { x , y , z }$ with $L ( T ) ≥ 9 δ$. Let $p ∈ T$, and let us assume, with no loss of generality, that $p ∈ [ x y ]$. Since G is $δ$-hyperbolic, $d ( p , [ x z ] ∪ [ y z ] ) ≤ δ$. If $d ( p , x ) , d ( p , y ) > δ$, then there is a path $γ$ with $L ( γ ) ≤ δ$ joining p to $[ x z ] ∪ [ y z ]$. In particular, there is a shortcut $σ ⊂ γ$ with $L ( σ ) ≤ L ( γ ) ≤ δ$ joining some shortcut vertex $p ′ ∈ [ x y ]$ with $d ( p , p ′ ) < δ$ to $[ x z ] ∪ [ y z ]$. Therefore, if $L ( [ x y ] ) > 2 δ$, for every point $q ∈ [ x y ]$, there is a shortcut vertex $q ′ ∈ [ x y ]$ such that $d T ( q , q ′ ) < 2 δ + 1$ associated with a shortcut with length at most $δ$. Since $L ( T ) ≥ 9 δ$, by triangle inequality, there is at most one side of the triangle with length at most $2 δ$. Then, for every point p in the triangle, there is a shortcut vertex $p ′$ such that $d T ( p , p ′ ) < 3 δ + 1$ associated with a shortcut with length at most $δ$. Thus, it suffices to consider $ε = 3 δ + 1$, $k = 9 δ$ and $m = δ$. ☐
Remark 7.
Notice that in Corollary 3, we obtain that a graph G is quasi-isometric to a tree if and only if all the cycles satisfy a certain property, and Theorem 6 states that the same property, restricted to the cycles that are geodesic triangles, characterizes being hyperbolic.
The following theorem can be also obtained as a corollary of Theorems 1 and 5. However, the direct proof provides a better bound for the parameter $Δ$.
Theorem 7.
Given a uniform graph G, if every minimal vertex separator has diameter at most m, then G satisfies (BP) (i.e., G is quasi-isometric to a tree). Moreover, it suffices to take $Δ = m + 2$.
Proof.
If $m = 0$, it is trivial to see that G is a tree, and it satisfies (BP) with $Δ = 0$. Assume $m ≥ 1$. By Proposition 2, it suffices to check the property for pairs of vertices. Thus, consider any pair of vertices $a , b ∈ V ( G )$, and let c be a midpoint of a geodesic $[ a b ]$.
If $d ( a , b ) ≤ 2$, then (BP) is trivial with $Δ ′ = 1$. Suppose $d ( a , b ) ≥ 3$. Then, there is some vertex $v 0$ in the interior of $[ a b ]$ with $d ( v 0 , c ) ≤ 1 2$. By Lemma 1, since $[ a b ]$ is a geodesic, there exists a minimal $a b$-separator S containing $v 0$. Thus, every $a b$-path contains a vertex in S, and since $d i a m ( S ) ≤ m$, every $a b$-path passes through $N m ( v 0 ) ⊂ N m + 1 2 ( c )$. Hence, (BP) is satisfied on the vertices with $Δ ′ = m + 1 2$, and by Proposition 2, G satisfies (BP) with $Δ = m + 2$. ☐
The following example shows that the converse is not true.
Example 2.
Let G be the graph whose vertices are all the pairs $( a , b )$ with either $a ∈ N$ and $b = 0$ or $4 n + 1 ≤ a ≤ 4 n + 3$ and $1 ≤ b ≤ n$ for every $n ∈ N$, and such that $( a , b )$ is adjacent to $( a ′ , b ′ )$ if and only if either $b = b ′$ and $| a ′ − a | = 1$ or $a = a ′$ and $| b ′ − b | = 1$. See Figure 3.
Now, notice that $S n = { 4 n + 2 , j } 0 ≤ j ≤ n$ defines a minimal $( 4 n , 0 ) ( 4 n + 4 , 0 )$-separator with diameter n for every $n ∈ N$. Therefore, G has minimal $a b$-separators arbitrarily big. However, to see that G satisfies (BP), consider the map $f : V ( G ) → V ( G )$ such that $f ( i , j ) = ( 4 n + 2 , j )$ for every $4 n + 1 ≤ i ≤ 4 n + 3$ and $1 ≤ j ≤ n$ and the identity on the rest of the vertices. It is trivial to check that f extends to a $( 1 , 2 )$-quasi-isometry on G where the image is a tree. Therefore, G is quasi-isometric to a tree and satisfies (BP) (and it is ε-densely $( k , m )$-chordal).
Remark 8.
In the case of uniform graphs, the following theorem can also be obtained as a corollary of Proposition 1 and Theorem 7. Furthermore, it follows from Theorem 3 in  and Theorem 5. However, the direct proof provides a better bound for the parameter.
Theorem 8.
If G is $( k , 1 )$-chordal, then G satisfies (BP). Moreover, it suffices to take $Δ = k 4 + 5 2$.
Proof.
Consider any pair of vertices $a , b$, any geodesic $[ a b ]$ in G and the midpoint c in $[ a b ]$. If $d ( a , b ) ≤ k 2 + 2$, then (BP) is trivially satisfied for $Δ ′ = k 4 + 1$. Suppose $d ( a , b ) > k 2 + 2$ and that there is an $a b$-path $γ$ not intersecting $N k / 4 + 1 ( c )$. Let $a ′ ∈ [ a c ] ⊂ [ a b ]$ and $b ′ ∈ [ c b ] ⊂ [ a b ]$ such that $d ( a ′ , c ) = d ( c , b ′ ) = k 4$. Then, since $γ$ does not intersect $N k / 4 + 1 ( c )$, there is a cycle C contained in $[ a b ] ∪ γ$ such that $[ a ′ b ′ ] ⊂ C$ and $L ( C ) ≥ k$.
Claim: there is a one-shortcut in C joining a vertex in the interior of $[ a ′ b ′ ]$ to a vertex in $γ$. Since G is $( k , 1 )$-chordal, there is a one-shortcut, $σ 1$, in C. If $σ 1$ joins a vertex in the interior of $[ a ′ b ′ ]$ to a vertex in $γ$, we are done. Otherwise, we obtain a new cycle, $C 1$, such that $[ a ′ b ′ ] ⊂ C 1$ and, therefore, $L ( C 1 ) ≥ k$. Repeating the process, we finally obtain a one-shortcut joining a vertex $z 1$ in the interior of $[ a ′ b ′ ]$ to a vertex $z 2$ in $γ$.
Therefore, $d ( c , z 2 ) ≤ d ( c , z 1 ) + 1 < k 4 + 1$ and $z 2 ∈ N k / 4 + 1 ( c )$, leading to a contradiction.
Thus, G satisfies (BP) on the vertices with $Δ = k 4 + 1$, and by Proposition 2, G satisfies (BP) with $Δ = k 4 + 5 2$. ☐
Corollary 4.
If G is $( k , 1 )$-chordal, then G is quasi-isometric to a tree.
Remark 9.
Corollary 4 follows also from Proposition 1 and Corollary 1 in the case of uniform graphs.
Remark 10.
The converse to Theorem 8 or Corollary 4 is not true. It is immediate to check that the graph from Example 1 is quasi-isometric to a tree through the map sending every cycle $C n$ to the vertex n.
Remark 11.
Herein, the gap between being hyperbolic and being quasi-isometric to a tree is shown to depend on which cycles are ε-densely $( k , m )$-chordal, only geodesic triangles or all of them. Furthermore, we have seen that (BP) characterizes geodesic spaces quasi-isometric to trees. There exist also properties that characterize when a hyperbolic space is quasi-isometric to a tree. Corollary 1.9 in  states that two visual hyperbolic geodesic spaces $X , Y$ are quasi-isometric if and only if there is a PQ-symmetric homeomorphism f (where ’PQ’ stands for ’power quasi’) with respect to any visual metrics between their boundaries (The property of being visual has different names in the literature. For example, it is called “having a pole” in [50,51] or being “almost geodesically complete” in .).
Furthermore, there is a one-to-one correspondence between rooted trees and bounded ultrametric spaces where every tree induces a bounded ultrametric space, and for every bounded ultrametric space X there is a tree whose boundary is X. See  or .
Thus, a visual hyperbolic space is quasi-isometric to a tree if and only if its boundary is PQ-symmetric homeomorphic to an ultrametric space.
Furthermore, Theorem 1 in  states that given a complete geodesic space X with $H 1 ( X )$ uniformly generated, then X is quasi-isometric to a tree if and only if there is a function $f : X → R$ such that f is bornologous and metrically proper on the connected components.
Since any hyperbolic space has uniformly generated $H 1$, then it follows that for any hyperbolic graph G, G is quasi-isometric to a tree if and only if there is a function $f : G → R$ such that f is bornologous and metrically proper on the connected components.

## 4. Minimal Vertex r-Separators

Definition 11.
Given $r ∈ N$, two vertices a and b are r-separated by a subset $S ⊂ V ( G )$ if considering the connected components of $G \ S$, $G a$ and $G b$ containing a and b respectively, for every pair of vertices $v ∈ G a$ and $w ∈ G b$, $d ( v , w ) > r$. If a and b are two vertices r-separated by S, then S is said to be an $a b$-r-separator.
Remark 12.
Notice that separated means one-separated.
Definition 12.
S is a minimal $a b$-r-separator if no proper subset of Sr-separates a and b. Finally, S is a minimal vertex r-separator if it is a minimal r-separator for some pair of vertices.
Remark 13.
Given any minimal $a b$-r-separator S, every vertex in S is either adjacent to $G a$ or $G b$. Moreover, if $r ≥ 2$, then there are two disjoint subsets $S a$ and $S b$ such that $S = S a ∪ S b$ where the vertices in $S a$ are adjacent to $G a$ and the vertices in $S b$ are adjacent to $G b$. Furthermore, for every vertex v in $S a$, $d ( v , S b ) = r − 1$.
Lemma 4.
Let G be a uniform graph and $r ≥ 2$. Given any geodesic $[ a b ]$ with $d ( a , b ) > r$ and two vertices $v 1 , v 2 ∈ [ a b ]$ distinct from $a , b$ with $d ( v 1 , v 2 ) = r − 1$, then there is a minimal $a b$-r-separator containing ${ v 1 , v 2 }$.
Proof.
Suppose $[ a b ]$ is a geodesic with $d ( a , b ) > r$. Let us assume that $d ( a , v 1 ) < d ( a , v 2 )$, and define $ε 1 = d ( a , v 1 )$ and $ε 2 = d ( v 2 , b )$. Since G is uniform, for every vertex $v ∈ G$ the set $S ( v , ε )$ is finite for every $ε ∈ N$. Let $S 0 : = S ( a , ε 1 ) ∪ S ( b , ε 2 )$. It is immediate to check that $S 0$ is an $a b$-r-separator and $[ a b ] ∩ S 0 = { v 1 , v 2 }$. Since $S 0$ is finite, then there is a minimal subset $S ⊂ S 0$ which is also an $a b$-r-separator. Finally, since $[ a b ] ∩ S 0 = { v 1 , v 2 }$, $v i ∈ S$ for $i = 1 , 2$. ☐
Theorem 9.
Let G be a uniform graph and $r ≥ 2$. If every minimal vertex r-separator has diameter at most m with $m ≤ r$, then G is $( r + 1 2 )$-densely $( 2 r + 2 , r )$-chordal.
Proof.
Let C be any cycle with $L ( C ) ≥ 2 r + 2$, and let $x 1$ be any vertex in C. Then, consider two vertices $a , b$ in C such that $d C ( a , b ) = r + 1$, $d C ( a , x 1 ) = 1$ and $d C ( x 1 , b ) = r$. Let $γ 1$ and $γ 2$ be the two independent paths joining a and b defined by C, and assume $x 1 ∈ γ 1$. Consider $x 2 ∈ γ 1$ with $x 2$ between $x 1$ and b such that $d C ( x 1 , x 2 ) = r − 1$ (and $d C ( x 2 , b ) = 1$).
If $γ 1$ is not a geodesic, then there is a shortcut with length at most r and a shortcut vertex v such that $d C ( x 1 , v ) < r$.
If $γ 1$ is a geodesic, by Lemma 4, there exists a minimal $a b$-r-separator S containing $x 1 , x 2$. Then, there exist $y 1 , y 2 ∈ γ 2 ∩ S$, with $y 1$ between a and $y 2$, such that $d C ( y 1 , y 2 ) ≥ r − 1$, $d C ( a , y 1 ) ≥ 1$ and $d C ( y 2 , b ) ≥ 1$. Since $d i a m ( S ) ≤ m$, then $d ( x 1 , y 2 ) ≤ m$. Since $d C ( x 1 , y 2 ) ≥ r + 1 ≥ m + 1$, there is a shortcut $σ$ in C joining $x 1$ and $y 2$ with $L ( σ ) ≤ m ≤ r$ and with an associated shortcut vertex v such that $d C ( x 1 , v ) < m ≤ r$.
Thus, for every vertex $x 1$, there is a shortcut vertex v such that $d C ( x 1 , v ) < r$, and therefore, shortcut vertices define a $( r + 1 2 )$-dense subset in C. ☐
Theorem 10.
Let G be a uniform graph and $r ≥ 2$. If for every minimal $a b$-r-separator S either $S a$ or $S b$ has diameter at most m, then G is ε-densely $( k , k 2 )$-chordal with $k = 2 m + 2 r + 2$ and $ε = max { m + 1 2 + r , m + 1 2 }$.
Proof.
Let C be any cycle with $L ( C ) ≥ 2 m + 2 r + 2$ and $x 1$ be any vertex in C. Then, consider two vertices $a , b$ in C such that $d C ( a , b ) = m + r + 1$, $d C ( a , x 1 ) = m + 1 2$ and $d C ( x 1 , b ) = m + 1 2 + r$ if m is odd, and $d C ( a , x 1 ) = m 2 + 1$ and $d C ( x 1 , b ) = m 2 + r$ if m is even. Let $γ 1$ and $γ 2$ be the two independent paths joining a and b defined by C, and assume $x 1 ∈ γ 1$. Consider $x 2 ∈ γ 1$ with $x 2$ between $x 1$ and b such that $d C ( x 1 , x 2 ) = r − 1$ (and therefore, $d C ( x 2 , b ) ≥ m 2 + 1 > m 2$).
If $γ 1$ is not a geodesic, then there is a shortcut with length at most $m + r + 1$ and a shortcut vertex v such that $d C ( x 1 , v ) < m 2 + r$.
If $γ 1$ is a geodesic, consider S the minimal $a b$-r-separator containing $x 1 , x 2$ built in the proof of Lemma 4, and let us assume, without loss of generality, that $S a$ has diameter at most m. Then, by construction, there exists $y 1 ∈ γ 2 ∩ S$ such that $d γ 2 ( a , y 1 ) ≥ d ( a , y 1 ) = d ( a , x 1 ) ≥ m + 1 2$. Since $d i a m ( S a ) ≤ m$, then $d ( x 1 , y 1 ) ≤ m$. However, $d C ( x 1 , y 1 ) ≥ min { m + 1 , d γ 1 ( x 1 , b ) + d ( b , y 1 ) } = m + 1$, and therefore, there is a shortcut $σ$ in C joining $x 1$ and $y 1$ with $L ( σ ) ≤ m$. Moreover, there is a shortcut vertex v such that $d C ( x 1 , v ) < m$.
Thus, for every vertex $x 1$, there is a shortcut vertex v with $d C ( x 1 , v ) < min { m 2 + r , m }$, and therefore, shortcut vertices define an $ε$-dense subset in C with $ε = max { m + 1 2 + r , m + 1 2 }$. ☐
Then, from Theorems 5 and 10, we can obtain immediately the following:
Corollary 5.
Let G be a uniform graph and $r ≥ 2$. If for every minimal $a b$-r-separator S either $S a$ or $S b$ has diameter at most m, then G satisfies (BP), i.e.,, G is quasi-isometric to a tree.
Furthermore, from Theorems 3, 9 and 10, we obtain:
Corollary 6.
Let G be a uniform graph and $r ≥ 2$. If every minimal vertex r-separator has diameter at most m with $m ≤ r$, then G is δ-hyperbolic. Moreover, $δ ( G ) ≤ 2 r + 1 2$.
Corollary 7.
Let G be a uniform graph and $r ≥ 2$. If for every minimal $a b$-r-separator S either $S a$ or $S b$ has diameter at most m, then G is δ-hyperbolic. Moreover, $δ ( G ) ≤ max { 3 m + 3 2 + 2 r , 2 m + r + 3 2 } }$.

## 5. Neighbor Separators

Given a set S in a graph G, let $N r ( S ) : = { x ∈ G | d ( x , S ) ≤ r }$.
Definition 13.
Given two vertices $a , b$ in a graph $G = ( V , E )$ and some $r ∈ N$, a set $S ⊂ V$ is an $a b$-$N r$-separator if a and b are in different components of $G \ N r ( S )$. S is an $a b$-neighbor separator if it is an $a b$-$N r$-separator for some r.
Notice that an $a b$-separator is just an $a b$-$N 0$-separator.
Theorem 11.
G satisfies (BP) if and only if there is a constant $Δ ″ > 0$ such that for every pair of vertices $a , b$ with $d ( a , b ) ≥ 2 Δ ″ + 2$ and any geodesic $[ a b ]$, there exists a vertex $c ∈ [ a b ]$ that is an $a b$-$N Δ ″$-separator.
Proof.
The only if part follows trivially from Proposition 2.
Suppose that for every pair of vertices $a , b$ with $d ( a , b ) ≥ 2 Δ ″ + 2$ and any geodesic $[ a b ]$, there exists a point $c ∈ [ a b ]$ that is an $a b$-$N Δ ″$-separator. Consider any pair of vertices $x , y$ in G, any geodesic $[ x y ]$ and the midpoint z in $[ x y ]$.
If $d ( x , y ) ≤ 2 Δ ″ + 1$, then (BP) is trivially satisfied on $x , y$ for any $Δ ′ ≥ Δ ″ + 1 2$.
If $d ( x , y ) ≥ 2 Δ ″ + 2$, by hypothesis, there is some vertex $z 1 ∈ [ x y ]$ such that $N Δ ″ ( z 1 )$ is an $x y$-$N Δ ″$-separator. If $d ( z , z 1 ) ≤ Δ ″$, then it follows that every $x y$-path intersects $N Δ ″ ( z 1 ) ⊂ N 2 Δ ′ ′ ( z )$ and G satisfies (BP) on the vertices for $Δ ′ = 2 Δ ″$. If $d ( z , z 1 ) > Δ ″$, then we repeat the process with the part of the geodesic, $[ x z 1 ]$ or $[ z 1 y ]$, containing z. Let us assume, without loss of generality, that $z ∈ [ x z 1 ]$. Since $d ( z , z 1 ) > Δ ″$ and $d ( x , z ) > Δ ″$, there is some point $z 2 ∈ [ x z 1 ]$ that is an $x z 1$-$N Δ ″$-separator. Since there is a $z 1 y$-path in $G \ N Δ ″ ( z 2 )$, $z 2$ is also an $x y$-$N Δ ″$-separator. If $d ( z , z 2 ) ≤ Δ ″$, we are done. Otherwise, we repeat the process until we obtain some point $z k ∈ [ x y ]$ that is an $x y$-$N Δ ″$-separator and such that $d ( z , z k ) ≤ Δ ″$. Therefore, G satisfies (BP) on the vertices for $Δ ′ = 2 Δ ″$.
Thus, by Proposition 2, G satisfies (BP) with $Δ = 2 Δ ″ + 3 2$. ☐
Corollary 8.
G is quasi-isometric to a tree if and only if there is a constant $Δ ″ > 0$ such that for every pair of vertices $a , b$ with $d ( a , b ) > Δ ″$ and any geodesic $[ a b ]$, there exists a vertex $c ∈ [ a b ]$ that is an $a b$-$N Δ ″$-separator.
Proposition 3.
If G is $( k , 1 )$-chordal, then for every pair of vertices $a , b$, any geodesic $[ a b ]$ with $d ( a , b ) ≥ k 2 + 2$ and every pair of vertices $a ′ , b ′ ∈ [ a b ]$ with $d ( { a ′ , b ′ } , { a , b } ) ≥ 2$ and such that $d ( a ′ , b ′ ) ≥ k 2 − 2$, $[ a ′ b ′ ] ⊂ [ a b ]$ is an $a b$-$N 1$-separator. In particular, for every pair of vertices $a , b$ in G with $d ( a , b ) ≥ k 2 + 2$, there is a geodesic σ of length $k 2 − 2$ or $k − 3 2$ such that σ is an $a b$-$N 1$-separator.
Proof.
Consider any geodesic $[ a b ]$ in G with $d ( a , b ) ≥ k 2 + 2$ and any pair of vertices $a ′ , b ′ ∈ [ a b ]$ with $d ( { a ′ , b ′ } , { a , b } ) ≥ 2$ such that $d ( a ′ , b ′ ) ≥ k 2 − 2$. Let $a ″$ be the vertex in $[ a a ′ ] ⊂ [ a b ]$ adjacent to $a ′$ and $b ″$ be the vertex in $[ b ′ b ] ⊂ [ a b ]$ adjacent to $b ′$. Therefore, $d ( a ″ , b ″ ) ≥ k 2$. Suppose that a and b are in the same connected component, A, of $G \ N 1 ( [ a ′ b ′ ] )$. Clearly, $a ″$ and $b ″$ are adjacent to A. Let $γ$ be a path of minimal length joining $a ″$ and $b ″$ in the subgraph induced by $A ∪ { a ″ , b ″ }$. Therefore, $[ a ″ b ″ ] ∪ γ$ defines a cycle, C, of length at least k. Since G is $( k , 1 )$-chordal, then there is an edge joining two non-adjacent vertices in C. Since $[ a ″ b ″ ]$ is geodesic and $γ$ has minimal length, the edge must join a vertex, $v ∈ γ$ to a vertex in $[ a ′ b ′ ]$. Therefore, $v ∈ N 1 ( [ a ′ b ′ ] ) ∩ A$ leading to a contradiction. ☐
Definition 14.
A path γ in a graph G is chordal if it has no one-shortcuts in G.
Proposition 4.
If G is $( k , 1 )$-chordal, then for every chordal $a b$-path σ with $L ( σ ) ≥ k$ and every pair of vertices $a ′ , b ′ ∈ σ$ with $d σ ( { a ′ , b ′ } , { a , b } ) ≥ 2$ and such that $d σ ( a ′ , b ′ ) ≥ k − 4$, then the restriction of σ joining $a ′$ and $b ′$, $σ ′$, is an $a b$-$N 1$-separator. In particular, for every pair of vertices $a , b$ in G joined by a chordal path with length at least k there is a chordal path $γ ′$ of length $k − 4$ such that $γ ′$ is an $a b$-$N 1$-separator.
Proof.
Consider any chordal path $σ$ in G with endpoints $a , b$ and $L ( σ ) ≥ k$. Consider any pair of vertices $a ′ , b ′ ∈ [ a b ]$ with $d σ ( { a ′ , b ′ } , { a , b } ) ≥ 2$ such that $d σ ( a ′ , b ′ ) ≥ k − 4$, and let $σ ′ = [ a ′ b ′ ] ⊂ [ a b ]$. Let $a ″$ be the vertex in $σ$ adjacent to $a ′$ closer in $σ$ to a and $b ″$ be the vertex in $σ$ adjacent to $b ′$ closer in $σ$ to b. Therefore, if $σ ″$ is the restriction of $σ$ joining $a ″$ and $b ″$, then $L ( σ ″ ) ≥ k − 2$. Suppose that a and b are in the same connected component, A, of $G \ N 1 ( σ ′ )$. Clearly, $a ″$ and $b ″$ are adjacent to A. Let $γ$ be a path of minimal length joining $a ″$ and $b ″$ in the subgraph induced by $A ∪ { a ″ , b ″ }$. Therefore, $σ ″ ∪ γ$ defines a cycle, C, of length at least k. Since G is $( k , 1 )$-chordal, then there is an edge joining two non-adjacent vertices in C. Since $σ ″$ is chordal and $γ$ has minimal length, the edge must join a vertex $v ∈ γ$ to a vertex in $σ ′$. Therefore, $v ∈ N 1 ( σ ′ ) ∩ A$, leading to a contradiction. ☐
Proposition 5.
If a graph G satisfies that for some $k , m ∈ N$ with $k ≥ 4 m$, for every geodesic $[ a b ]$ with $d ( a , b ) ≥ k + 2$ and for every pair of vertices $a ′ , b ′ ∈ [ a b ]$ with $d ( { a ′ , b ′ } , { a , b } ) ≥ m + 1$ and such that $d ( a ′ , b ′ ) ≥ k − 2 m$, $[ a ′ b ′ ] ⊂ [ a b ]$ is an $a b$-$N m$-separator, then G is $( k 2 + 2 )$-densely $( 2 k + 4 , k + 1 )$-chordal.
Proof.
Let C be any cycle with $L ( C ) ≥ 2 k + 4$. Let v by any vertex in C and $a , b$ two vertices in C such that $d C ( a , v ) = k 2 + 1$ and $d C ( v , b ) = k 2 + 1$, and therefore, $d C ( a , b ) = k + 2$. Let $γ 1 , γ 2$ be the two $a b$-paths defined by the cycle, and let us assume that $v ∈ γ 1$ (and therefore, $L ( γ 1 ) ≤ L ( γ 2 )$). If there is a shortcut in $γ 1$, then there is a shortcut in C with length at most $k + 1$ and with a shortcut vertex z such that $d C ( v , z ) < k 2 + 2$. If there is no shortcut in $γ 1$, then $γ 1$ is a geodesic with $d ( a , b ) = k + 2$. Thus, let $a ′ , b ′ ∈ γ 1$ with $d ( a , a ′ ) = m + 1 = d ( b ′ , b )$ and $d ( a ′ , b ′ ) = k − 2 m$. Therefore, $[ a ′ b ′ ] ⊂ γ 1$ is an $a b$-$N m$-separator. In particular, there is some vertex w in $γ 2 \ { a , b }$ such that $w ∈ N m ( [ a ′ b ′ ] )$, defining a shortcut in C with length at most m and with a shortcut vertex z such that $d C ( v , z ) < k 2 + 1$. ☐
Corollary 9.
If a graph G satisfies that for some $k , m ∈ N$ with $k ≥ 4 m$, for every geodesic $[ a b ]$ with $d ( a , b ) ≥ k + 2$ and for every pair of vertices $a ′ , b ′ ∈ [ a b ]$ with $d ( { a ′ , b ′ } , { a , b } ) ≥ m + 1$ and such that $d ( a ′ , b ′ ) ≥ k − 2 m$, $[ a ′ b ′ ] ⊂ [ a b ]$ is an $a b$-$N m$-separator, then G is quasi-isometric to a tree.

## 6. Neighbor Obstructors

Definition 15.
Given two vertices $a , b$ in a graph $G = ( V , E )$ and some $r ∈ N$, a set $S ⊂ V$ is $a b$-$N r$-obstructing if for every geodesic γ joining a and b, $γ ∩ N r ( S ) ≠ ∅$.
Given any metric space $( X , d )$ and any pair of subsets $A , B ⊂ X$, let us recall that the Hausdorff metric, $d H$, induced by d is:
$d H ( A 1 , A 2 ) : = m a x { sup x ∈ A 1 { d ( x , A 2 ) } , sup y ∈ A 2 { d ( y , A 1 ) } } ,$
or equivalently,
$d H ( A 1 , A 2 ) : = inf { ε > 0 | A 1 ⊂ B ( A 2 , ε ) y A 2 ⊂ B ( A 1 , ε ) } .$
Definition 16.
In a geodesic metric space $( X , d )$, we say that geodesics are stable if and only if there is a constant $R ≥ 0$ such that given two points $x , y ∈ X$ and any geodesic $[ x y ]$, then every geodesic σ joining x to y satisfies that $d H ( σ , [ x y ] ) ≤ R$.
It is well known that if X is a hyperbolic space, then quasi-geodesics are stable. See, for example, Theorem III.1.7 in . In particular, geodesics are stable in hyperbolic geodesic spaces.
Let $B$ be the family of cycles that are bigons.
Theorem 12.
Given a graph G, geodesics are stable if and only if there exist constants $ε > 0$ and $k , m ∈ N$ such that G is ε-densely $( k , m )$-chordal on $B$.
Proof.
Suppose that G is $ε$-densely $( k , m )$-chordal on $B$. Consider any pair of points $x , y$ and any pair of geodesics, $σ 1 , σ 2$, joining them. Then, for any point $z ∈ σ 1$, either $z ∈ σ 1 ∩ σ 2$ or there is a cycle $C ⊂ σ 1 ∪ σ 2$ with $z ∈ C$. If $L ( C ) < k$, then $d ( z , σ 2 ) < k 2$. If $L ( C ) ≥ k$, then either $d C ( z , σ 2 ) < ε$ or there is an m-shortcut in C with a shortcut vertex v such that $d C ( z , v ) < ε$, and since $σ 1$ is geodesic, $d ( v , σ 2 ) ≤ m$. Thus, if $R = max { k 2 , ε + m }$, $d ( z , σ 2 ) < R$ in any case. Hence, $σ 1 ⊂ N R ( σ 2 )$. The same argument proves that $σ 2 ⊂ N R ( σ 1 )$, and therefore, $d H ( σ 1 , σ 2 ) ≤ R$.
Suppose that geodesics are stable with constant R. Consider any pair of points $x , y$ with $d ( x , y ) ≥ 2 R + 2$ and two $x y$-geodesics $σ 1 , σ 2$ such that $σ 1 ∪ σ 2$ defines a cycle C. Then, for any point $z ∈ σ 1$ (respectively with $σ 2$) such that $d C ( z , σ 2 ) > R$ (resp. $d C ( z , σ 1 ) > R$), since $d H ( σ 1 , σ 2 ) ≤ R$, $d ( z , σ 2 ) ≤ R$ (resp. $d ( z , σ 1 ) ≤ R$), and there is a strict R-shortcut in C with a shortcut vertex v such that $d C ( v , z ) < R$. Thus, shortcut vertices are $( 2 R + 1 )$-dense in C and G is $( 2 R + 1 )$-densely $( 4 R + 4 , R )$-chordal on $B$. ☐
Definition 17.
In a graph G, we say that geodesics between vertices are stable if and only if there is a constant $R ≥ 0$ such that given two vertices $a , b ∈ G$ and any geodesic $[ a b ]$, then every geodesic σ joining a to b satisfies that $d H ( σ , [ a b ] ) ≤ R$.
Proposition 6.
Given a graph G, geodesics between vertices are stable if and only if there is some constant $k ∈ N$ so that for every pair of vertices $a , b$ with $d ( a , b ) ≥ 2 k + 2$, every geodesic $[ a b ]$ and every vertex $v ∈ [ a b ]$ such that $d ( v , { a , b } ) > k$, then v is an $a b$-$N k$-obstructing vertex.
Proof.
Suppose that geodesics between vertices are stable with constant R. Then, given any two vertices $a , b ∈ G$ with $d ( a , b ) ≥ 2 R + 2$ and any geodesic $[ a b ]$, every geodesic $σ$ joining a to b satisfies that $d H ( σ , [ a b ] ) ≤ R$. Thus, for every vertex $v ∈ [ a b ]$ there is some vertex $w ∈ σ$ such that $d ( v , w ) ≤ R$. Suppose $v ∈ [ a b ]$ with $d ( v , { a , b } ) > R$. Hence, v is an $a b$-$N R$-obstructing vertex.
Now, suppose that for every pair of vertices $a , b$ with $d ( a , b ) ≥ 2 k + 2$, every geodesic $[ a b ]$ and every vertex $v ∈ [ a b ]$ with $d ( v , { a , b } ) > k$, then v is an $a b$-$N k$-obstructing vertex. Consider any pair of vertices $a , b ∈ G$ and any pair of $a b$-geodesics $σ 1 , σ 2$. If $d ( a , b ) < 2 k + 2$, then it is trivial to check that $d H ( σ 1 , σ 2 ) < k + 1$. Suppose $d ( x , y ) ≥ 2 k + 2$. Then, for every vertex $v ∈ σ 1$ such that $d ( v , { a , b } ) > k$, $σ 2 ∩ N k ( v ) ≠ ∅$. Therefore, it follows immediately that $σ 1 ⊂ N k + 1 / 2 ( σ 2 )$. The same argument proves that $σ 2 ⊂ N k + 1 / 2 ( σ 1 )$, and therefore, $d H ( σ 1 , σ 2 ) < k + 1$. ☐
Let $B 0$ be the family of cycles that are bigons defined by two geodesics between vertices.
Proposition 7.
If G is $k 4$-densely $( k , m )$-chordal on $B 0$, then for every pair of vertices $a , b$ with $d ( a , b ) ≥ k 2 + 4$, every geodesic $[ a b ]$ and every vertex $v 0$ such that $d ( v 0 , { a , b } ) ≥ k 4 + 1$, $v 0$ is an $a b$-$N k$-obstructing vertex. In particular, $[ a b ]$ contains an $a b$-$N k$-obstructing vertex.
Proof.
Consider any pair of vertices $a , b$ with $d ( a , b ) ≥ k 2 + 4$, any geodesic $[ a b ]$ and any vertex $v 0 ∈ [ a b ]$ with $d ( v 0 , { a , b } ) ≥ k 4 + 1$. Let $a ′$ be the vertex in $[ a v 0 ] ⊂ [ a b ]$ with $d ( a ′ , v 0 ) = k 4$ and $b ′$ be the vertex in $[ v 0 b ] ⊂ [ a b ]$ with $d ( v 0 , b ′ ) = k 4$. Therefore, $d ( a ′ , b ′ ) ≥ k 2$, $a ′ ≠ a$ and $b ′ ≠ b$.
If there is no geodesic joining a to b disjoint from $N k / 4 ( v 0 )$, we are done.
Suppose there is some geodesic $γ 0$ joining a to b such that $γ 0 ∩ N k / 4 ( v 0 ) = ∅$. Then, $[ a b ] ∪ γ 0$ contains a cycle C (with possibly $C = [ a b ] ∪ γ 0$) composed by two geodesics $γ 1 = [ a ″ b ″ ]$ with $[ a ′ b ′ ] ⊂ [ a ″ b ″ ] ⊂ [ a b ]$ and $γ 2 ⊂ γ 0$ joining also $a ″$ to $b ″$. Clearly, $L ( C ) ≥ k$. Since G is $k 4$-densely $( k , m )$-chordal on $B 0$, then there is a strict shortcut $σ$ with $L ( σ ) ≤ m$ joining two vertices in C with a shortcut vertex $v 1$ in $N k / 4 ( v 0 )$. Furthermore, since $γ 1$ and $γ 2$ are geodesics, then $σ$ joins $v 1$ to a vertex $v 2$ in $γ 2 ⊂ γ 0$. Therefore, $d ( v 2 , v 0 ) ≤ m + k 4 < k$ (see Remark 2) and $γ 0 ∩ N k ( v 0 ) ≠ ∅$. ☐
Theorem 13.
Given a graph G, geodesics between vertices are stable if and only if there exist constants $ε > 0$ and $k , m ∈ N$ such that G is ε-densely $( k , m )$-chordal on $B 0$.
Proof.
Suppose that G is $ε$-densely $( k , m )$-chordal on $B 0$. By Proposition 7, if $k ′ = max { 4 ε , k }$, then for every pair of vertices $a , b$ with $d ( a , b ) ≥ k ′ 2 + 4$, every geodesic $[ a b ]$ and every vertex $v 0$ such that $d ( v 0 , { a , b } ) ≥ k ′ 4 + 1$, $v 0$ is an $a b$-$N k ′$-obstructing vertex. Thus, by Proposition 6, geodesics are stable with constant $R = k ′ 4 + 2$.
Let us suppose that geodesics between vertices are stable with constant R. Let $a , b$ be two vertices with $d ( a , b ) ≥ 2 R + 2$ and C be a cycle that is a bigon defined by two $a b$-geodesics, $σ 1 , σ 2$. Therefore, $L ( C ) ≥ 4 R + 4$. Consider any vertex $v ∈ σ 1$ (respectively, $σ 2$) such that $d ( v , { a , b } ) > R$. Then, since geodesics between vertices are stable with parameter R, $v ∈ N R ( σ 2 )$ (respectively, $σ 1$) and there is a strict R-shortcut in C with an associated shortcut vertex w such that $d C ( v , w ) < R$, therefore shortcut vertices are $( 2 R + 1 )$-dense in C, and G is $( 2 R + 1 )$-densely $( 4 R + 4 , R )$-chordal on $B 0$. ☐
The following example shows that having stable geodesics between vertices does not imply that geodesics are stable.
Example 3.
Consider the family of odd cycles ${ C 2 k + 1 : k ∈ N }$, and suppose we fix a vertex $v k$ in each cycle; we define a connected graph G identifying the family ${ v k : k ∈ N }$ as a single vertex v. Notice that in G geodesics between vertices are unique. If two vertices belong to the same cycle $C 2 k + 1$, then the geodesic is contained in the cycle, and it is clearly unique. Otherwise, the geodesic is the union of the two (unique) shortest paths joining the vertices to v. Thus, geodesics between vertices are stable with constant zero.
Let $m k$ be the midpoint of an edge in $C 2 k + 1$ such that $d ( m k , v ) = k + 1 2$. Then, $C 2 k + 1$ is a bigon in G defined by two geodesics, $σ 1 , σ 2$ joining $m k$ to v and $d H ( σ 1 , σ 2 ) = k 2 + 1 4$ with k arbitrarily large.
Remark 14.
Notice that the same property that characterizes being quasi-isometric to a tree (Corollary 3) also characterizes being hyperbolic, when restricted to triangles (Theorem 6), having stable geodesics, when restricted to bigons (Theorem 12), and having stable geodesics between vertices, when restricted to bigons between vertices (Theorem 13).
Remark 15.
In the context of multi-path routing, (BP) implies that given any nominal path (with minimum cost) joining x and y, then any other path would remain close (at least at some point) to the nominal one. Furthermore, if we consider all paths with minimum cost, the stability of geodesics characterized above implies that every point of any minimal path is close to the nominal one.
The proof of Proposition 7 can be adapted to prove also the following:
Proposition 8.
If G is $( k 4 − m )$-densely $( k , m )$-chordal on $B 0$ with $k > 4 m$, then for every geodesic $[ a b ]$ with $d ( a , b ) ≥ k 2 + 2$ and every pair of vertices $a ′ , b ′ ∈ [ a b ]$ with $d ( { a ′ , b ′ } , { a , b } ) ≥ m + 1$ and such that $d ( a ′ , b ′ ) ≥ k 2 − 2 m$, $[ a ′ b ′ ] ⊂ [ a b ]$ is an $a b$-$N m$-obstructing set. In particular, for every pair of vertices $a , b$ in G with $d ( a , b ) ≥ k 2 + 2$, there is a geodesic σ of length $k 2 − 2 m$ or $k + 1 2 − 2 m$ such that σ is $a b$-$N m$-obstructing.
Proof.
Consider any geodesic $[ a b ]$ with $d ( a , b ) ≥ k 2 + 2$ and any pair of vertices $a ′ , b ′ ∈ [ a b ]$ with $d ( { a ′ , b ′ } , { a , b } ) ≥ m + 1$ and $d ( a ′ , b ′ ) ≥ k 2 − 2 m$. Let $a ″$ be the vertex in $[ a a ′ ] ⊂ [ a b ]$ with $d ( a ′ , a ″ ) = m$ and $b ″$ be the vertex in $[ b ′ b ] ⊂ [ a b ]$ with $d ( b ′ , b ″ ) = m$. Therefore, $d ( a ″ , b ″ ) ≥ k 2$.
Suppose that there is some geodesic $γ 0$ joining a and b such that $γ ∩ N m ( [ a ′ b ′ ] ) = ∅$. Then, $[ a b ] ∪ γ 0$ contains a cycle C composed by two geodesics: $γ 1$ with $[ a ″ b ″ ] ⊂ γ 1 ⊂ [ a b ]$ and $γ 2 ⊂ γ 0$. Clearly, $L ( C ) ≥ k$. Consider the midpoint c in $[ a ′ b ′ ]$. Since G is $( k 4 − m )$-densely $( k , m )$-chordal on $B 0$, then there is a strict shortcut $σ$ with $L ( σ ) ≤ m$ joining two vertices in C with a shortcut vertex $v 1$ such that $d C ( v 1 , c ) ≤ k 4 − m$, and hence, $v 1 ∈ [ a ′ b ′ ]$. Furthermore, since $γ 1$ and $γ 2$ are geodesics, then $σ$ joins $v 1$ to a vertex, $v 2$, in $γ 2 ⊂ γ 0$. Therefore, $d ( v 2 , [ a ′ b ′ ] ) ≤ m$ and $γ 0 ∩ N m ( [ a ′ b ′ ] ) ≠ ∅$, leading to a contradiction. ☐

## Acknowledgments

The author was partially supported by MTM2015-63612P.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Gromov, M. Hyperbolic groups. In Essays in Group Theory; Gersten, S.M., Ed.; Mathematical Science Research Institute Publications; Springer: New York, NY, USA, 1987; Volume 8, pp. 75–263. [Google Scholar]
2. Bridson, M.; Haefliger, A. Metric Spaces of Non-Positive Curvature; Springer: Berlin, Germany, 1999. [Google Scholar]
3. Burago, D.; Burago, Y.; Ivanov, S. A course in metric geometry. In Graduate Studies in Mathematics; AMS: Providence, RI, USA, 2001; Volume 33. [Google Scholar]
4. Buyalo, S.; Schroeder, V. Elements of Asymptotic Geometry. In EMS Monographs in Mathematics; European Mathematical Society: Zürich, Switzerland, 2007. [Google Scholar]
5. Gyhs, E.; de la Harpe, P. Sur le groupes hyperboliques d’après Mikhael Gromov. In Progress in Math; Birkhäuser: Boston, MA, USA, 1990; Volume 83. [Google Scholar]
6. Väisälä, J. Gromov hyperbolic spaces. Expos. Math. 2005, 23, 187–231. [Google Scholar] [CrossRef]
7. Bermudo, S.; Rodríguez, J.M.; Rosario, O.; Sigarreta, J.M. Small values of the hyperbolicity constant in graphs. Discret. Math. 2016, 339, 3073–3084. [Google Scholar] [CrossRef]
8. Bermudo, S.; Rodríguez, J.M.; Sigarreta, J.M. Computing the hyperbolicity constant. Comput. Math. Appl. 2011, 62, 4592–4595. [Google Scholar] [CrossRef]
9. Carballosa, W.; Pestana, D.; Rodríguez, J.M.; Sigarreta, J.M. Distortion of the hyperbolicity constant of a graph. Electron. J. Comb. 2012, 19, # P67. [Google Scholar] [PubMed]
10. Carballosa, W.; Rodríguez, J.M.; Sigarreta, J.M.; Villeta, M. Gromov hyperbolicity of line graphs. Electron. J. Comb. 2011, 18, # P210. [Google Scholar]
11. Bermudo, S.; Rodríguez, J.M.; Sigarreta, J.M.; Vilaire, J.-M. Gromov hyperbolic graphs. Discret. Math. 2013, 313, 1575–1585. [Google Scholar] [CrossRef]
12. Chepoi, V.; Dragan, F.F.; Estellon, B.; Habib, M.; Vaxes, Y. Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs. Electron. Notes Discret. Math. 2008, 31, 231–234. [Google Scholar] [CrossRef]
13. Frigerio, R.; Sisto, A. Characterizing hyperbolic spaces and real trees. Geom. Dedicata 2009, 142, 139–149. [Google Scholar] [CrossRef]
14. Hästö, P.A. Gromov hyperbolicity of the jG and $ȷ ˜ G$ metrics. Proc. Am. Math. Soc. 2006, 134, 1137–1142. [Google Scholar] [CrossRef]
15. Michel, J.; Rodríguez, J.M.; Sigarreta, J.M.; Villeta, M. Hyperbolicity and parameters of graphs. Ars Comb. 2011, 100, 43–63. [Google Scholar]
16. Pestana, D.; Rodríguez, J.M.; Sigarreta, J.M.; Villeta, M. Gromov hyperbolic cubic graphs. Cent. Eur. J. Math. 2012, 10, 1141–1151. [Google Scholar] [CrossRef]
17. Portilla, A.; Rodríguez, J.M.; Sigarreta, J.M.; Vilaire, J.-M. Gromov hyperbolic tessellation graphs. Util. Math. 2015, 97, 193–212. [Google Scholar]
18. Portilla, A.; Rodríguez, J.M.; Tourís, E. Gromov hyperbolicity through decomposition of metric spaces II. J. Geom. Anal. 2004, 14, 123–149. [Google Scholar] [CrossRef]
19. Portilla, A.; Rodríguez, J.M.; Tourís, E. Stability of Gromov hyperbolicity. J. Adv. Math. Stud. 2009, 2, 77–96. [Google Scholar]
20. Portilla, A.; Tourís, E. A characterization of Gromov hyperbolicity of surfaces with variable negative curvature. Publ. Matorsz. 2009, 53, 83–110. [Google Scholar] [CrossRef][Green Version]
21. Rodríguez, J.M.; Sigarreta, J.M. Bounds on Gromov hyperbolicity constant in graphs. Proc. Indian Acad. Sci. Math. Sci. 2012, 122, 53–65. [Google Scholar] [CrossRef]
22. Rodríguez, J.M.; Sigarreta, J.M.; Torres-Nuñez, Y. Computing the hyperbolicity constant of a cubic graph. Int. J. Comput. Math. 2014, 91, 1897–1910. [Google Scholar] [CrossRef]
23. Rodríguez, J.M.; Sigarreta, J.M.; Vilaire, J.-M.; Villeta, M. On the hyperbolicity constant in graphs. Discret. Math. 2011, 311, 211–219. [Google Scholar] [CrossRef]
24. Sigarreta, J.M. Hyperbolicity in median graphs. Proc. Indian Acad. Sci. Math. Sci. 2013, 123, 455–467. [Google Scholar] [CrossRef]
25. Tourís, E. Graphs and Gromov hyperbolicity of non-constant negatively curved surfaces. J. Math. Anal. Appl. 2011, 380, 865–881. [Google Scholar] [CrossRef]
26. Dress, A.; Holland, B.; Huber, K.T.; Koolen, J.H.; Moulton, V.; Weyer-Menkhoff, J. Δ additive and Δ ultra-additive maps, Gromov’s trees, and the Farris transform. Discret. Appl. Math. 2005, 146, 51–73. [Google Scholar] [CrossRef]
27. Dress, A.; Moulton, V.; Terhalle, W. T-theory: An overview. Eur. J. Comb. 1996, 17, 161–175. [Google Scholar] [CrossRef]
28. Clauset, A.; Moore, C.; Newman, M.E.J. Hierarchical structure and the prediction of missing links in networks. Nature 2008, 453, 98–101. [Google Scholar] [CrossRef] [PubMed]
29. Krioukov, D.; Papadopoulos, F.; Kitsak, M.; Vahdat, A.; Boguñá, M. Hyperbolic geometry of complex networks. Phys. Rev. E 2010, 82, 036106. [Google Scholar] [CrossRef] [PubMed]
30. Shang, Y. Lack of Gromov-hyperbolicity in small-world networks. Cent. Eur. J. Math. 2012, 10, 1152–1158. [Google Scholar] [CrossRef]
31. Shang, Y. Non-hyperbolicity of random graphs with given expected degrees. Stoch. Model. 2013, 29, 451–462. [Google Scholar] [CrossRef]
32. Jonckheere, E.A. Contrôle du traffic sur les réseaux à géométrie hyperbolique—Vers une théorie géométrique de la sécurité l’acheminement de l’information. J. Eur. Syst. Autom. 2002, 8, 45–60. [Google Scholar]
33. Jonckheere, E.A.; Lohsoonthorn, P. Geometry of network security. Proc. Am. Control Conf. 2004, 2, 976–981. [Google Scholar]
34. Jonckheere, E.A.; Lou, M.; Bonahon, F.; Baryshnikov, Y. Euclidean versus hyperbolic congestion in idealized versus experimental networks. Int. Math. 2011, 7, 1–27. [Google Scholar] [CrossRef]
35. Sreenivasa Kumar, P.; Veni Madhavan, C.E. Minimal vertex separators of chordal graphs. Discret. Appl. Math. 1998, 89, 155–168. [Google Scholar] [CrossRef]
36. Blair, J.; Peyton, B. An introduction to chordal graphs and clique trees, Graph Theory and Sparse Matrix Multiplication. In IMA Volumes in Mathematics and its Applications; Springer: Berlin, Germany, 1993; Volume 56, pp. 1–29. [Google Scholar]
37. Brinkmann, G.; Koolen, J.; Moulton, V. On the hyperbolicity of chordal graphs. Ann. Comb. 2001, 5, 61–69. [Google Scholar] [CrossRef]
38. Wu, Y.; Zhang, C. Hyperbolicity and chordality of a graph. Electron. J. Comb. 2011, 18, # P43. [Google Scholar]
39. Bermudo, S.; Carballosa, W.; Rodríguez, J.M.; Sigarreta, J.M. On the hyperbolicity of edge-chordal and path-chordal graphs. Filomat 2016, 30, 2599–2607. [Google Scholar] [CrossRef]
40. Martínez-Pérez, A. Chordality properties and hyperbolicity on graphs. Electron. J. Comb. 2016, 23, # P3.51. [Google Scholar]
41. Dirac, G.A. On rigid circuit graphs. Abh. Math. Semin. Univ. Hambg. 1961, 25, 71–76. [Google Scholar] [CrossRef]
42. Krithika, R.; Mathew, R.; Narayanaswamy, N.S.; Sadagopan, N. A Dirac-type Characterization of k-chordal Graphs. Discret. Math. 2013, 313, 2865–2867. [Google Scholar] [CrossRef]
43. Anandkumar, A.; Tan, V.; Huang, F.; Willsky, A.S. High-dimensional Gaussian graphical model selection: Walk summability and local separation criterion. J. Mach. Learn. Res. 2012, 13, 2293–2337. [Google Scholar]
44. Manning, J.F. Geometry of pseudocharacters. Geom. Topol. 2005, 9, 1147–1185. [Google Scholar] [CrossRef]
45. Bestvina, M.; Bromberg, K.; Fujiwara, K. Constructing group actions on quasi-trees and applications to mapping class groups. Publ. Math. l’IHÉS 2015, 122, 1–64. [Google Scholar] [CrossRef]
46. Cashen, C.H. A Geometric Proof of the Structure Theorem for Cyclic Splittings of Free Groups. Topol. Proc. 2017, 50, 335–349. [Google Scholar]
47. Martínez-Pérez, A. Real-valued functions and metric spaces quasi-isometric to trees. Ann. Acad. Sci. Fenn. Math. 2012, 37, 525–538. [Google Scholar] [CrossRef]
48. Rodríguez, J.M.; Tourís, E. Gromov hyperbolicity through decomposition of metric spaces. Acta Math. Hung. 2004, 103, 53–84. [Google Scholar] [CrossRef]
49. Martínez-Pérez, A. Quasi-isometries between visual hyperbolic spaces. Manuscr. Math. 2012, 137, 195–213. [Google Scholar] [CrossRef]
50. Cao, J. Cheeger isoperimetric constants of Gromov-hyperbolic spaces with quasi-pole. Commun. Contemp. Math. 2000, 4, 511–533. [Google Scholar] [CrossRef]
51. Martínez-Pérez, A.; Rodríguez, J.M. Cheeger isoperimetric constant of Gromov hyperbolic manifolds and graphs. Commun. Contemp. Math. 2017, in press. [Google Scholar] [CrossRef]
52. Bieri, R.; Geoghegan, R. Limit sets for modules over groups on CAT(0) spaces: From the Euclidean to the hyperbolic. Proc. Lond. Math. Soc. 2016, 112, 1059–1102. [Google Scholar] [CrossRef]
53. Hughes, B. Trees and ultrametric spaces: A categorical equivalence. Adv. Math. 2004, 189, 148–191. [Google Scholar] [CrossRef]
54. Martínez-Pérez, A.; Morón, M.A. Uniformly continuous maps between ends of ℝ-trees. Math. Z. 2009, 263, 583–606. [Google Scholar] [CrossRef]
Figure 1. The set ${ d , e }$ is a minimal $a b$-separator, but it is not a minimal separator.
Figure 1. The set ${ d , e }$ is a minimal $a b$-separator, but it is not a minimal separator.
Figure 2. Every minimal vertex separator has diameter at most two, but the graph is not $( k , 1 )$-chordal for any $k > 0$.
Figure 2. Every minimal vertex separator has diameter at most two, but the graph is not $( k , 1 )$-chordal for any $k > 0$.
Figure 3. Satisfying the bottleneck property does not imply the existence of minimal vertex separators with uniformly-bounded diameters.
Figure 3. Satisfying the bottleneck property does not imply the existence of minimal vertex separators with uniformly-bounded diameters.