Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Characterization Results for theL(2, 1, 1)-Labeling Problem on Trees

Xiaoling ZhangKecai Deng — 2017

Discussiones Mathematicae Graph Theory

An L(2, 1, 1)-labeling of a graph G is an assignment of non-negative integers (labels) to the vertices of G such that adjacent vertices receive labels with difference at least 2, and vertices at distance 2 or 3 receive distinct labels. The span of such a labelling is the difference between the maximum and minimum labels used, and the minimum span over all L(2, 1, 1)-labelings of G is called the L(2, 1, 1)-labeling number of G, denoted by λ2,1,1(G). It was shown by King, Ras and Zhou in [The L(h,...

Page 1

Download Results (CSV)