Abstract
A digraph G is k -geodetic if for any pair of (not necessarily distinct) vertices u, v is an element of V (G) there is at most one walk of length <......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
