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

We study the following inverse graph-theoretic problem: how many verticesshould a graph have given that it has a specified value of some parameter. Weobtain asymptotic for the minimal number of vertices of the graph with thegiven number $n$ of maximal independent sets for a class of natural numbersthat can be represented as concatenation of periodic binary words.

Inverse problems for the number of maximal independent sets