Circular L(j,k)-labeling number of direct product of path and cycle

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.