L(d_1,d_2,...,d_t)-Number λ(C_n;d_1,d_2,...,d_t) of Cycles  

圈的L(d_1,d_2,…,d_t)-数λ(C_n;d_1,d_2,…,d_t)(英文)

作　　者：高振滨 张晓东 

机构地区：[1]College of Science,Harbin Engineering University [2]Department of Mathematics,Shanghai Jiaotong University

出　　处：《Journal of Mathematical Research and Exposition》2009年第4期682-686,共5页数学研究与评论（英文版）

基　　金：the National Natural Science Foundation of China (No.10531070);the National Basic Research Program of China 973 Program (No.2006AA11Z209);the Natural Science Foundation of Shanghai City (No.06ZR14049)

摘　　要：An L（d0,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 If（x） - f（y）l ≥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,...,dr）- 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）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)

关 键 词：CYCLE LABELING L（d1  d2  ...  dt）-labeling λ（G d1  d2 ... dt）-number. 

分 类 号：O157.5[理学—数学]