Regular Factor in Vertex Transitive Graphs |
Received:September 25, 2001 |
Key Words:
vertex transitive graph regular factor restricted edge cut fragment.
|
Fund Project:Supported by NNSF of China (10271105) and Doctoral Foundation of Zhangzhou Normal College. |
|
Hits: 1921 |
Download times: 786 |
Abstract: |
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. |
Citation: |
DOI:10.3770/j.issn:1000-341X.2004.03.004 |
View Full Text View/Add Comment Download reader |