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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A dominating set D of a graph G = (V;E) is non-split dominating set ifhV n Di is connected. The non-split domination number of G is the minimum cardinality of a non-split dominating set inG. LetD be a minimum dominating set inG. If a subset D 0 of V n D is dominating in G, then D 0 is called an inverse dominating set with respect to D. Furthermore, if

Non-split and Inverse Non-split Domination Numbers in the Join and Corona of Graphs