Labeling graphs with two distance constraints

Given a graph G and integers p,q,d"1 and d"2, with p>q, d"2>d"1>=1, an L(d"1,d"2;p,q)-labeling of G is a function f:V(G)->{0,1,2,...,n} such that |f(u)-f(v)|>=p if d"G(u,v)==q if d"G(u,v)=