The multi-level distance number for symmetric lobster-like trees about the weight center

作者：Zuo Liancui; Guo Hongfang; Shang Chunhong^*

来源：IAENG International Journal of Applied Mathematics, 2015, 45(1).

• Distance labeling
• Labelings
• Multilevels
• Symmetric lobster-like tree about the weight center
• The minimum span

The multi-level distance labeling for a network G is a function f: V(G) →{0,1,2,...} so that |f(u) - f(v)| ≥diam(G) + 1 - d(u,v) for any u,v ∈V(G), where diam(G) is the diameter of G and d(u, v) is the distance between u and v. The span of f is defined as max{f(u) |f(u) - f(v)| u,v ∈V(G)}. The multi-level distance number of G is the minimum span of all multi-level distance labelings for G. In the present paper, a class of symmetric lobster-like trees about the weight center is studied, and its multi-level distance number is obtained.