Gromov hyperbolicity of periodic planar graphs

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.     

Bounds on Gromov hyperbolicity constant in graphs

If X is a geodesic metric space and x ₁,x ₂,x ₃ ∈ X, a geodesic triangle T = {x ₁,x ₂,x ₃} is the union of the three geodesics [x ₁ x ₂], [x ₂ x ₃] and [x ₃ x ₁] 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 two other sides, for every geodesic triangle T in X. If X is hyperbolic, we denote by δ(X) the sharp hyperbolicity constant of X, i.e. $\delta(X)=\inf\{\delta\ge 0: \, X \, \text{ is $\delta(X)=\inf\{\delta\ge 0: \, X \, \text{ is In this paper we relate the hyperbolicity constant of a graph with some known parameters of the graph, as its independence number, its maximum and minimum degree and its domination number. Furthermore, we compute explicitly the hyperbolicity constant of some class of product graphs.     

Generalizations of the notion of hyperbolicity

We describe several generalizations of the classical notion of hyperbolicity for a sequence of linear mappings. It is shown that the following three statements are equivalent: (i) the corresponding linear non-homogeneous system has a bounded solution for any bounded nonhomogeneity, (ii) the sequence has a (C, λ)-structure, (iii) the sequence is piecewise hyperbolic with long enough intervals of hyperbolicity.     

On hyperbolicity cones associated with elementary symmetric polynomials

Elementary symmetric polynomials can be thought of as derivative polynomials of . Their associated hyperbolicity cones give a natural sequence of relaxations for . We establish a recursive structure for these cones, namely, that the coordinate projections of these cones are themselves hyperbolicity cones associated with elementary symmetric polynomials. As a consequence of this recursion, we give an alternative characterization of these cones, and give an algebraic characterization for one particular dual cone associated with together with its self-concordant barrier functional.     

Graphs and Gromov hyperbolicity of non-constant negatively curved surfaces

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.     

Matching arc complexes: Connectedness and hyperbolicity

Addressing a question of Zaremsky, we give conditions on a finite simplicial graph which guarantee that the associated matching arc complex is connected and hyperbolic.     

On covering expander graphs by hamilton cycles

The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum degree Δ satisfies some basic expansion properties and contains a family of edge disjoint Hamilton cycles, then there also exists a covering of its edges by Hamilton cycles. This implies that for every α > 0 and every there exists a covering of all edges of G(n,p) by Hamilton cycles asymptotically almost surely, which is nearly optimal.Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 183‐200, 2014     

Twists and Gromov hyperbolicity of riemann surfaces

The main aim of this paper is to study whether the Gromov hyperbolicity is preserved under some transformations on Riemann surfaces (with their Poincaré metrics). We prove that quasiconformal maps between Riemann surfaces preserve hyperbolicity; however, we also show that arbitrary twists along simple closed geodesics do not preserve it, in general.     

Gromov hyperbolicity of Denjoy Domains

In this paper we characterize the Gromov hyperbolicity of the double of a metric space. This result allows to give a characterization of the hyperbolic Denjoy domains, in terms of the distance to of the points in some geodesics. In the particular case of trains (a kind of Riemann surfaces which includes the flute surfaces), we obtain more explicit criteria which depend just on the lengths of what we have called fundamental geodesics. Research partially supported by three grants from M.E.C. (MTM 2006-11976, MTM 2006-13000-C03-02 and MTM 2004-21420-E), Spain.     

On conditional edge-connectivity of graphs

1. IntroductionIn this paper, a graph G ~ (V,E) always means a simple graph (without loops andmultiple edges) with the vertex-set V and the edge-set E. We follow [1] for graph-theoreticalterllilnology and notation not defined here.It is well known that when the underlying topology of a computer interconnectionnetwork is modeled by a graph G, the edge-connectivity A(G) of G is an important measurefor fault-tolerance of the network. However, it has many deficiencies (see [2]). MotiVatedby t…     

Geometric tools to determine the hyperbolicity of limit cycles

In this paper we present a new method to study limit cycles' hyperbolicity. The main tool is the function ν=([V,W]∧V)/(V∧W), where V is the vector field under investigation and W a transversal one. Our approach gives a high degree of freedom for choosing operators to study the stability. It is related to the divergence test, but provides more information on the system's dynamics. We extend some previous results on hyperbolicity and apply our results to get limit cycles' uniqueness. Liénard systems and conservative + dissipative systems are considered among the applications.     

On the diameter of Kronecker graphs

We prove that a.a.s. as soon as a Kronecker graph becomes connected it has a finite diameter.     

Characterization of Gromov hyperbolic short graphs

To decide when a graph is Gromov hyperbolic is,in general,a very hard problem.In this paper,we solve this problem for the set of short graphs(in an informal way,a graph G is r-short if the shortcuts in the cycles of G have length less than r):an r-short graph G is hyperbolic if and only if S9r(G)is finite,where SR(G):=sup{L(C):C is an R-isometric cycle in G}and we say that a cycle C is R-isometric if dC(x,y)≤dG(x,y)+R for every x,y∈C.     

Gromov hyperbolicity in Cartesian product graphs

If X is a geodesic metric space and x ₁, x ₂, x ₃ ∈ X, a geodesic triangle T = {x ₁, x ₂, x ₃} is the union of the three geodesics [x ₁ x ₂], [x ₂ x ₃] and [x ₃ x ₁] 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. If X is hyperbolic, we denote by δ(X) the sharp hyperbolicity constant of X, i.e. δ(X) = inf{δ ≥ 0: X is δ-hyperbolic}. In this paper we characterize the product graphs G ₁ × G ₂ which are hyperbolic, in terms of G ₁ and G ₂: the product graph G ₁ × G ₂ is hyperbolic if and only if G ₁ is hyperbolic and G ₂ is bounded or G ₂ is hyperbolic and G ₁ is bounded. We also prove some sharp relations between the hyperbolicity constant of G ₁ × G ₂, δ(G ₁), δ(G ₂) and the diameters of G ₁ and G ₂ (and we find families of graphs for which the inequalities are attained). Furthermore, we obtain the precise value of the hyperbolicity constant for many product graphs.     

On the connectivity and superconnected graphs with small diameter

In this paper, first we prove that any graph G is 2-connected if diam(G)≤g−1 for even girth g, and for odd girth g and maximum degree Δ≤2δ−1 where δ is the minimum degree. Moreover, we prove that any graph G of diameter diam(G)≤g−2 satisfies that (i) G is 5-connected for even girth g and Δ≤2δ−5, and (ii) G is super-κ for odd girth g and Δ≤3δ/2−1.