Abstract
Suppose G is a graph. Let u be a vertex of G. A vertex v is called an ineighbour of u if dG(u, v) = i. A 1-neighbour of u is simply called a neighbour......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
