1) Edge-transitive Graphs
边可迁图
2) regular edge transitive graph
正则边可迁图
1.
It also proved that if a regular edge transitive graph has order at least 3 k , then its k th extra edge connectivity and k th isoperi metric edge connectivity are equal.
首先举例说明在一般情形下两者可以不等 ,然后再证明当正则边可迁图的阶不小于 3k时 ,它的 k阶超常边连通度与 k阶等周边连通度相
3) Vertex-transitive graph
点可迁图
1.
The equality holds when G is a cubic or 4-regular connected vertex-transitive graph with the only exception that G is a 4-regular graph with λ3(G) = 4.
当G是3或者4正则连通点可迁图时等号成立,除非G是4正则图并且 λ3(G)=4。
4) vertex transitive graph
点可迁图
1.
Let G be a fc-regular connected vertex transitive graph.
设图G是一个K-正则连通点可迁图。
2.
Let G be a connected kregular vertex transitive graph.
设G是k正则连通点可迁图。
5) the quasi-transitive graph
拟可迁图
6) vertex-transitive graphs
顶点可迁图
1.
On wide existence of the non-chromatically unique connected vertex-transitive graphs;
非色唯一的连通顶点可迁图的广泛存在性
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条