L(p,q)L(p,q)-labeling of a graph embeddable on the torus

In the paper, we give an upper bound for the λp,qλp,q-number of a graph GG embeddable on an orientable surface SnSn in term of nn and the maximum degree of GG. In particular, we give upper bounds for λp,qλp,q-numbers of a graph GG embeddable on the torus using p,qp,q and the maximum degree of GG.