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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

If D is a digraph, then K∈V(D) is a quasi-kernel of D if DKis discrete and for each y∈V(D)K there is x∈K such that the directed distance from y to x is less than three. We give formulae for the number of quasi-kernels and for the number of minimal quasi-kernels of oriented paths and cycles

Quasi-Kernels for Oriented Paths and Cycles