Abstract
The L(3, 2, 1) -labeling number of a graph G is the smallest number k such that G has a k-L(3, 2, 1) -labeling. In 2015, Kim et al.[L(3,2,1)-labeling ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
