Characterization Results for the L(2, 1, 1)-Labeling Problem on Trees
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 maxim...
Main Authors: | Zhang Xiaoling, Deng Kecai |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2017-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1935 |
Similar Items
-
Pair L(2, 1)-Labelings of Infinite Graphs
by: Yeh Roger K.
Published: (2019-02-01) -
On subset labelings of trees
by: Gary Chartrand, et al.
Published: (2024-01-01) -
On L(2, 1)-Labelings of Oriented Graphs
by: Colucci Lucas, et al.
Published: (2022-02-01) -
On (p, 1)-Total Labelling of Some 1-Planar Graphs
by: Niu Bei, et al.
Published: (2021-05-01) -
On L(d,1)-labelling of Trees
by: Irena Hrastnik, et al.
Published: (2020-06-01)