【摘要】 介绍了l-边-连通度的定义及定义在抽象群上的Cayley图;利用构造最小l-序列边割的方法,结合Cayley图的性质,研究了3-正则Cayley图的l-边-连通度;给出并证明了l为2、3、4时的l-边-连通度λl(G);同时,给出了对n-正则Cayley图的l-边-连通度的推论.更多还原

【Abstract】 The definitions of the l-edge-connectivity and the Cayley graph are given in this paper.Using method of the minimum l-sequential cut and the character of the Cayley graph,the author researched the l-edge-connectivity of 3-regular Cayley graph G and proved the λl(G) with l=2,3,4,meanwhile,l-edge-connectivity of n-regular Cayley graph is deduced.更多还原