Abstract
Let G = (V, E) be a simple, loopless graph with non-empty edge set. An L(j, k)-edge-labeling of G is a function g from the edge set E to the set of al......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
