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/

Zendy Plus

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

Zendy Tools

Zendy Open

Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is abijection $\ell \colon V\rightarrow {1,...,n}$ for which there exists apositive integer $k$ such that $\sum_{x\in N(v)}\ell (x)=k$ for all $v\in V $,where $N(v)$ is the neighborhood of $v$. We introduce a natural subclass ofdistance magic graphs. For this class we show that it is closed for the directproduct with regular graphs and closed as a second factor for lexicographicproduct with regular graphs. In addition, we characterize distance magic graphsamong direct product of two cycles.

Distance magic labeling and two products of graphs