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 L(2,1)-labelling of a graph $G=(V, E)$ is $\lambda_{2,1}(G)$ a function$f$ from the vertex set V (G) to the set of non-negative integers such thatadjacent vertices get numbers at least two apart, and vertices at distance twoget distinct numbers. The L(2,1)-labelling number denoted by $\lambda_{2,1}(G)$of $G$ is the minimum range of labels over all such labelling. In this article,it is shown that, for a circular-arc graph $G$, the upper bound of$\lambda_{2,1}(G)$ is $\Delta+3\omega$, where $\Delta$ and $\omega$ representsthe maximum degree of the vertices and size of maximum clique respectively.

L(2,1)-labelling of Circular-arc Graph