DeepAI AI Chat
Log In Sign Up

Helly-gap of a graph and vertex eccentricities

by   Feodor F. Dragan, et al.

A new metric parameter for a graph, Helly-gap, is introduced. A graph G is called α-weakly-Helly if any system of pairwise intersecting disks in G has a nonempty common intersection when the radius of each disk is increased by an additive value α. The minimum α for which a graph G is α-weakly-Helly is called the Helly-gap of G and denoted by α(G). The Helly-gap of a graph G is characterized by distances in the injective hull ℋ(G), which is a (unique) minimal Helly graph which contains G as an isometric subgraph. This characterization is used as a tool to generalize many eccentricity related results known for Helly graphs (α(G)=0), as well as for chordal graphs (α(G)≤ 1), distance-hereditary graphs (α(G)≤ 1) and δ-hyperbolic graphs (α(G)≤ 2δ), to all graphs, parameterized by their Helly-gap α(G). Several additional graph classes are shown to have a bounded Helly-gap, including AT-free graphs and graphs with bounded tree-length, bounded chordality or bounded α_i-metric.


page 1

page 2

page 3

page 4


Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs

The reconfiguration graph R_k(G) of the k-colourings of a graph G contai...

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

A graph is Helly if every family of pairwise intersecting balls has a no...

Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable

It is known that testing isomorphism of chordal graphs is as hard as the...

Isometric path antichain covers: beyond hyperbolic graphs

The isometric path antichain cover number of a graph G, denoted by ipacc...

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity

For intractable problems on graphs of bounded treewidth, two graph param...

An Alon-Boppana theorem for powered graphs and generalized Ramanujan graphs

The r-th power of a graph modifies a graph by connecting every vertex pa...

First-order logic axiomatization of metric graph theory

The main goal of this note is to provide a First-Order Logic with Betwee...