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

The L(2, 1) -labeling (or distance two labeling) of a graph G is an integer labeling of G in which two vertices at distance one from each ot her must have labels differing by at least 2 and those at distance two m ust differ by at least 1. The L(2, 1) - labeling number λGof G is the smallest number k such that G has an L(2, 1) -labeling max{ ( ): ( )} f v v V G k ∈ = with maxfv: vVG k. In this paper, upper bound for the L(2, 1) -labeling number for the α-product of two graphs has been obtained in terms o f the maximum degrees of the graphs involved. Degrees of vertices, vertex of maximum degree and number of vertices of maximum degree have been discussed in the α-product of two graphs.

The L(2, 1)-labeling on &lt;i&gt;β&lt;/i&gt;-product of Graphs

The L(2, 1)-labeling on <i>β</i>-product of Graphs