  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.
