English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

Strongly Chordal Graph Generation using Intersection Graph Characterisation