圈的L（d1,d2,…,d_t）-数λ（C_n;d1,d2,…,d_t）(英文)

An L(d1,d2,...,dt)-labeling of a graph G is a function f from its vertex set V(G) to the set {0,1,...,k} for some positive integer k such that |f(x)-f(y)|≥di,if the distance between vertices x and y in G is equal to i for i = 1,2,...,t.The L(d1,d2,...,dt)-number λ(G;d1,d2,...,dt) of G is the smallest integer number k such that G has an L(d1,d2,...,dt)-labeling with max{f(x)|x ∈ V(G)} = k.In this paper,we obtain the exact values for λ(Cn;2,2,1) and λ(Cn;3,2,1),and present lower and upper bounds for λ(Cn;2,...,2,1,...,1)