TY - JOUR
T1 - Circular L(j,k)-labeling number of direct product of path and cycle
AU - Wu, Qiong
AU - Shiu, Wai Chee
AU - Sun, Pak Kiu
N1 - Funding Information:
This work is partially supported by GRF, Research Grant Council of Hong Kong; FRG, Hong Kong Baptist University.
PY - 2014/2
Y1 - 2014/2
N2 - Let j, k and m be positive numbers, a circular m-L(j,k)-labeling of a graph G is a function f:V(G)→[0,m) such that |f(u)-f(v)| m ≥j if u and v are adjacent, and |f(u)-f(v)| m ≥k if u and v are at distance two, where |a-b| m =min{|a-b|,m-|a-b|}. The minimum m such that there exist a circular m-L(j,k)-labeling of G is called the circular L(j,k)-labeling number of G and is denoted by σ j,k (G). In this paper, for any two positive numbers j and k with j≤k, we give some results about the circular L(j,k)-labeling number of direct product of path and cycle.
AB - Let j, k and m be positive numbers, a circular m-L(j,k)-labeling of a graph G is a function f:V(G)→[0,m) such that |f(u)-f(v)| m ≥j if u and v are adjacent, and |f(u)-f(v)| m ≥k if u and v are at distance two, where |a-b| m =min{|a-b|,m-|a-b|}. The minimum m such that there exist a circular m-L(j,k)-labeling of G is called the circular L(j,k)-labeling number of G and is denoted by σ j,k (G). In this paper, for any two positive numbers j and k with j≤k, we give some results about the circular L(j,k)-labeling number of direct product of path and cycle.
KW - Circular L(j,k)-labeling
KW - Direct product
UR - http://www.scopus.com/inward/record.url?scp=84895057181&partnerID=8YFLogxK
U2 - 10.1007/s10878-012-9520-9
DO - 10.1007/s10878-012-9520-9
M3 - Journal article
AN - SCOPUS:84895057181
SN - 1382-6905
VL - 27
SP - 355
EP - 368
JO - Journal of Combinatorial Optimization
JF - Journal of Combinatorial Optimization
IS - 2
ER -