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)-labeling of a graph is an assignment of nonnegative integers tothe vertices of G such that adjacent vertices receive numbers differed by atleast 2, and vertices at distance 2 are assigned distinct numbers. The L(2,1)-labeling number is the minimum range of labels over all such labeling. Itwas shown by Griggs and Yeh [Labelling graphs with a condition at distance 2,SIAM J. Discrete Math. 5(1992), 586-595] that the L(2, 1)-labeling number of atree is either \D+ 1 or \D + 2. In this paper, we give a completecharacterization of L(2, 1)-labeling number for trees with maximum degree 3.

A characterization of L(2, 1)-labeling number for trees with maximum degree 3