Strongly Chordal Graph Generation using Intersection Graph Characterisation

TL;DR

This paper introduces an algorithm for generating strongly chordal graphs based on their intersection graph characterisation, extending previous methods used for chordal graphs.

Contribution

It presents a novel algorithm that leverages the intersection graph characterisation to generate strongly chordal graphs.

Findings

Algorithm successfully generates strongly chordal graphs

Extends intersection graph characterisation to a new graph class

Provides a foundation for further graph generation research

Abstract

Strongly chordal graphs are a subclass of chordal graphs. Farber also established a number of different characterisations for this class of graphs. These include an intersection graph characterisation that is analogous to a similar characterisation for chordal graphs. Seker et al. exploited this characterisation of chordal graphs to obtain an algorithm for generating them. In this paper, we propose an algorithm to show that strongly chordal graphs can also be generated using their intersection graph characterisation.