Abstract
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive positive integers such that the sum of the labels ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
