Let G be a fc-regular connected vertex transitive graph. If G is not maximal restricted edge connected, then G has a (k- 1)-factor with components isomorphic to the same vertex transitive graph of order between k and 2k-3. This observation strenghen to some extent the corresponding result obtained by Watkins, which said that fc-regular vertex transitive graph G has a factor with components isomorphic to a vertex transitive graphs if G is not k connected.
【基金】
Supported by NNSF of China(10271105); Doctoral Foundation of Zhangzhou Normal College.
【更新日期】
2005-08-19
【分类号】
O157.5
【正文快照】
1 .Introduetion All graphs eonsidered in this Paper are undireeted eonneeted finite simPlek一regularvertex transitive盯aPhs withk七3 if not speeified.Restrieted edge eut 15 such皿edgeeut that separates a eonneeted罗即h into a diseonneeted one with no eomp