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 use a dynamic programming algorithm to establish a lower bound on thedomination number of complete grid graphs of the form $C_n\square P_m$, thatis, the Cartesian product of a cycle $C_n$ and a path $P_m$, for $m$ and $n$sufficiently large.

A New Lower Bound for the Domination Number of Complete Cylindrical Grid Graphs