DeepAI AI Chat
Log In Sign Up

Injective hulls of various graph classes

by   Heather M. Guarnera, et al.

A graph is Helly if its disks satisfy the Helly property, i.e., every family of pairwise intersecting disks in G has a common intersection. It is known that for every graph G, there exists a unique smallest Helly graph H(G) into which G isometrically embeds; H(G) is called the injective hull of G. Motivated by this, we investigate the structural properties of the injective hulls of various graph classes. We say that a class of graphs π’ž is closed under Hellification if G βˆˆπ’ž implies H(G) βˆˆπ’ž. We identify several graph classes that are closed under Hellification. We show that permutation graphs are not closed under Hellification, but chordal graphs, square-chordal graphs, and distance-hereditary graphs are. Graphs that have an efficiently computable injective hull are of particular interest. A linear-time algorithm to construct the injective hull of any distance-hereditary graph is provided and we show that the injective hull of several graphs from some other well-known classes of graphs are impossible to compute in subexponential time. In particular, there are split graphs, cocomparability graphs, bipartite graphs G such that H(G) contains Ξ©(a^n) vertices, where n=|V(G)| and a>1.


page 1

page 2

page 3

page 4

βˆ™ 09/08/2017

Obstructions to a small hyperbolicity in Helly graphs

It is known that for every graph G there exists the smallest Helly graph...
βˆ™ 05/29/2020

Biclique Graphs of K_3-free Graphs and Bipartite Graphs

A biclique of a graph is a maximal complete bipartite subgraph. The bicl...
βˆ™ 07/17/2019

Containment Graphs, Posets, and Related Classes of Graphs

In this paper, we introduce the notion of the containment graph of a fam...
βˆ™ 01/22/2023

A graph isomorphism invariant based on neighborhood aggregation

This paper presents a new graph isomorphism invariant, called 𝔴-labeling...
βˆ™ 01/16/2018

Graph-indexed random walks on special classes of graphs

We investigate the paramater of the average range of M-Lipschitz mapping...
βˆ™ 11/10/2021

Applications of Random Algebraic Constructions to Hardness of Approximation

In this paper, we show how one may (efficiently) construct two types of ...
βˆ™ 12/18/2018

Qualitative graph limit theory. Cantor Dynamical Systems and Constant-Time Distributed Algorithms

The goal of the paper is to lay the foundation for the qualitative analo...