搜索结果: 1-1 共查到“Set-homogeneous directed graphs”相关记录1条 . 查询时间(0.078 秒)
A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous...
