3-Restricted Edge Connectivity and Regular Factor

设 G是一个阶不小于 6的 k正则连通点可迁图 .如果 G不含三角形 ,那么图 G是极大 3限制边连通的 ,或者 G含有各连通分支都同构于同一个 h阶点可迁图的 k- 1正则因子 ,其中2 k- 2≤ h≤ 3k- 5.唯一的例外是 :G是围长等于 4的 3正则图Let be a connected regular vertex transitive graph of order at least 6. If is triangle free, then either is maximal 3 restricted edge connected, or \%G\% has a \%(k-1)\% regular factor with components isomorphic to a same vertex transitive graph of order \%h \%such that \%2k-2≤h≤3k-5.\% The only exception is that \%G \%is a cubic graph with girth 4.国家自然科学基金项目 ( 10 2 7110 5和 199710 71);; 漳州师范学院博士基金项