Abstract
In this paper, all graphs are assumed to be finite. Let s >= 1 be an integer. A graph is called s-CSH (s-connected-set-homogeneous) if for every pa......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
