1) the quasi-transitive graph
![点击朗读](/dictall/images/read.gif)
拟可迁图
2) Edge-transitive Graphs
![点击朗读](/dictall/images/read.gif)
边可迁图
3) Vertex-transitive graph
![点击朗读](/dictall/images/read.gif)
点可迁图
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
![点击朗读](/dictall/images/read.gif)
点可迁图
1.
Let G be a fc-regular connected vertex transitive graph.
![点击朗读](/dictall/images/read.gif)
设图G是一个K-正则连通点可迁图。
2.
Let G be a connected kregular vertex transitive graph.
![点击朗读](/dictall/images/read.gif)
设G是k正则连通点可迁图。
5) vertex-transitive graphs
![点击朗读](/dictall/images/read.gif)
顶点可迁图
1.
On wide existence of the non-chromatically unique connected vertex-transitive graphs;
![点击朗读](/dictall/images/read.gif)
非色唯一的连通顶点可迁图的广泛存在性
6) regular edge transitive graph
![点击朗读](/dictall/images/read.gif)
正则边可迁图
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阶等周边连通度相
补充资料:小迁
1.古人认为日出于旸谷﹐至昆吾而日光正中﹐至西南方鸟次之山﹐则日光偏西﹐称"小迁"。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条