L(j, k)-labeling numbers of square of paths

Wu, Q; Shiu, WC

Shiu, WC (reprint author), Hong Kong Baptist Univ, Dept Math, 224 Waterloo Rd, Kowloon Tong, Hong Kong, Peoples R China.

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2017; 14 (3): 307

Abstract

For j <= k, the L(j, k)-labeling arose from code assignment problem. That is, let j, k and m be positive numbers, an m-L(j, k)-labeling of a graph ......

Full Text Link