小度数点传递图的连通度(英文)  

The Connectivity of Vertex-transitive Graphs with Small Regular Degrees

作　　者：陈靓[1] 

机构地区：[1]新疆大学数学系,新疆 乌鲁木齐,830046

出　　处：《新疆大学学报（自然科学版）》2000年第4期5-7,共3页Journal of Xinjiang University(Natural Science Edition)

摘　　要：众所周知 ,k( k≤ 4 )正则连通点传递图的连通度达到了它的正则度 k.本文证明了除 Cn K2 ( n≥4 )外 ,每个 5正则连通点传递图的连通度都是 5,其中 Cn K2 是 n长圈与完全图 K2It is known that the connectivity of any \$k \$regular \$(k≤4)\$ connected vertex transitive graph attains its regular degree \$k.\$ Here we show that the connectivity of any 5 regular connected vertex transitive graph is 5 unless it is isomorphic to \$C\-nK\-2,\$ the lexicographic product of the cycle \$C\-n(n≥4)\$ of length \$n\$ and the complete graph \$K\-2\$ on two vertices.

关 键 词：连通度 小度数点传递图 正则图 

分 类 号：O157.5[理学—数学]