Abstract
A Cayley graph G = Cay(G, S) is said to be core-free if G is core-free in some X for G <= X <= Aut Gamma. A graph G is called s-regular if AutG ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
