1) 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阶等周边连通度相
2) Edge-transitive Graphs
边可迁图
3) edge regular graph
边正则图
4) 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。
5) 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正则连通点可迁图。
6) the quasi-transitive graph
拟可迁图
补充资料：物不迁正量论
【物不迁正量论】
（书名）二卷，明镇澄著。
（书名）二卷，明镇澄著。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条