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

An edge labeling of graph  G with labels in  A is an injection from  E G to  A , where  E G is the edge set of  G , and  A is a subset of  ℝ . A graph  G is called  ℝ -antimagic if for each subset  A of  ℝ with  A = E G , there is an edge labeling with labels in  A such that the sums of the labels assigned to edges incident to distinct vertices are different. The main result of this paper is that the Cartesian products of complete graphs (except  K 1 ) and cycles are  ℝ -antimagic.

Cartesian Products of Some Regular Graphs Admitting Antimagic Labeling for Arbitrary Sets of Real Numbers