Acta mathematica scientia,Series A ›› 2003, Vol. 23 ›› Issue (6): 650-654.

• Articles • Previous Articles     Next Articles

3 Restricted Edge Connectivity and Regular Factor

 OU Jian-Beng, ZHANG Fu-Ji-   

  1. 漳州师范学院数学系 漳州363000 汕头大学数学系 |汕头515063

    厦门大学数学系 厦门361005
  • Online:2003-12-25 Published:2003-12-25
  • Supported by:

    国家自然科学基金项目(10271105和19971071)和漳州师范学院博士基金项目

Abstract:

Let G be a connected k regular vertex transitive graph of order at least 6. If G is triangle free, then either G 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.

Key words: Graph, Edge connectivity, Factor

CLC Number: 

  • 05C70
Trendmd