L(3, 2, 1)-Labeling of Banana Trees

L(3, 2, 1)-Labeling of Banana Trees

An L(3, 2, 1)-labeling of a graph G is an assignment f from the vertex set V (G) to the set of non-negative integers such that |f (x) − f (y) | ≥ 3 if x and y are adjacent, | f (x) − f (y) | ≥ 2 if x and y are at distance 2, and | f (x) − f (y) | ≥ 1 if x and y are at distance 3, for all x and y in...

Full description

Bibliographic Details
Main Authors:	Murugan M., Sriraman P., Suriya M.
Format:	Article
Language:	English
Published:	Sciendo 2019-12-01
Series:	Annals of the West University of Timisoara: Mathematics and Computer Science
Subjects:	l(3, 2, 1)-labeling channel assignment banana tree k-number
Online Access:	https://doi.org/10.2478/awutm-2019-0018

Internet

https://doi.org/10.2478/awutm-2019-0018