1) transitive graph
传递图
1.
have proved that a vertex-transitive graph with degree d≥4 and girth g≥5or a d-regular edge-transitive graph with d≥4 and g≥4 is λ_((g-1))-optimal.
王铭和李乔证明了 :若 G是一个 d-正则的点传递图 ,d≥ 4,围长 g≥ 5 ,或者 G是一个 d-正则的边传递图 ,d≥ 4,围长 g≥ 4,则 G是λ(g - 1 ) -最优图 。
2) arc-transitive graph
弧传递图
3) s-transitive graph
s-传递图
4) 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图更具有普遍的意义,因为任何一个点传递图都是其全自同构群的某个陪集图。
5) Graphics transfer
图形传递
6) transitive graphs
半传递图
1.
In this paper we survey some new results on 1/2-transitive graphs which have been obtained since 1990 by the author and some other researchers.
本文综述了自１９９０年以来若干数学家包括作者本人在半传递图方面研究的最新结果。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条