1) weakly vertex-transitive graph
弱点传递图
2) Weakly vertex transitive
弱点传递
3) weakly vertex-transitive
弱顶点传递
4) weakly edge-transitive graph
弱边传递图
5) weakly arc-transitive graph
弱弧传递图
6) vertex-transitive graph
点传递图
1.
In this paper,we prove that a connected cubic vertex-transitive graph of order 2p~2(p a prime)is either a Cayley graph or isomorphic to the generalized Petersen graph p(p~2,t), where t~2≡-1(mod p~2
一个图称为点传递图,如果它的全自同构群在它的顶点集合上作用传递。
2.
In fact, researching the symmetry property of the Coset graph is more significant than the Cayleygraph, because every vertex-transitive graph is always some Coset graph of its full automorphism group.
关于陪集图对称性的研究其实较Cayley图更具有普遍的意义，因为任何一个点传递图都是其全自同构群的某个陪集图。
3.
In fact, researching the symmetry of Sabidussi coset graphs has more general significance than doing so for the Cayley graph because every vertex-transitive graph is always some coset graph of its full automorphism group.
关于陪集图对称性的研究其实较Cayley图更具有普遍的意义,因为任何一个点传递图都是其全自同构群的某个陪集图。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条