Abstract
A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undirected graph G is a mapping lambda from the set of vertices (resp. the set of e......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
