THE L(3,2,1) LABELING OF SOME GRAPHS

• Main Author: LAPENANGGA PUTRA (NIM: 20116029), GANESHA
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/27451
• Institution: Institut Teknologi Bandung

Let G=(V,E) be a nontrivial and connected graph. The L(3,2,1) labeling of graph G is a function f:V→ N∪{0} such that |f(u)-f(v)|≥ 3 for every u,v∈ V with d(u,v)=1, |f(u)-f(v)|≥ 2 for every u,v∈ V with d(u,v)=2, and |f(u)-f(v)|≥ 1...