𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hyperbolicity and complement of graphs

✍ Scribed by Sergio Bermudo; José M. Rodríguez; José M. Sigarreta; Eva Tourís


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
280 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis


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 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}. 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 aim of this paper is to obtain information about the hyperbolicity constant of the complement graph G in terms of properties of the graph G. In particular, we prove that if diam(V (G)) ≥ 3, then δ(G) ≤ 2, and that the inequality is sharp. Furthermore, we find some Nordhaus-Gaddum type results on the hyperbolicity constant of a graph δ(G).


📜 SIMILAR VOLUMES


Disconnected Complements of Steinhaus gr
✍ Wayne M. Dymàček; Matthew Koerlin; Jean-Guy Speton; Tom Whaley; Jennifer Yanulav 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 548 KB
Some parameters of graph and its complem
✍ Shao-ji Xu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 627 KB

In this paper, we have discussed the Nordhaus-Gaddum problems for diameter d, girth g, circumference c and edge covering number ill-We have both got the following results. If both G and G are connected, then 4<~d+a~~ 6, then p+2<.c+~<.2p, 3(p-1)<~c.~<.p 2. If both G and G have no isolated vertex, th

Clique-transversal sets of line graphs a
✍ Thomas Andreae; Martin Schughart; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 704 KB

Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics 88 (1991) 11-20. A clique-transversal set T of a graph G is a set of vertices of G such that T meets all maximal cliques of G. The clique-transversal number, denoted t,(

On the honesty of graph complements
✍ K.S. Bagga; L.W. Beineke; M.J. Lipman; R.E. Pippert 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 342 KB

A graph is called honest if its edge-integrity equals its order. It is shown in this paper that except for the path of length 3, every graph that is not honest has an honest complemenk. This result is extended to complements of products and applied to the Nordhaus-Gaddum theory for edgeintegrity.