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

A set $C$ of vertices of a simple graph is called a completely regular codeif for each $i=0$, $1$, $2$, \ldots and $j = i-1$, $i$, $i+1$, all vertices atdistance $i$ from $C$ have the same number $s_{ij}$ of neighbors at distance$j$ from $C$. We characterize the completely regular codes in the infinitehexagonal grid graph.

Completely regular codes in the infinite hexagonal grid