| 3-Restricted Edge Connectivity of Vertex Transitive Graphs of Girth Three |
| Received:September 29, 2002 |
| Key Words:
vertex-transitive graph 3-restricted edge connectivity restricted fragment
|
| Fund Project:National Natural Science Foundation of China (10271105); Foundation of Education Ministryof Fujian (JA03147); Ministry of Science and Technology of Fujian (2003J036). |
|
| Hits: 2426 |
| Download times: 1953 |
| Abstract: |
| Let G be a k-regular connected graph of order at least six. If G has girth three, its 3-restricted edge connectivity λ3(G) ≤3k-6. The equality holds when G is a cubic or 4-regular connected vertex-transitive graph with the only exception that G is a 4-regular graph with λ3(G) = 4. Furthermore, λ3(G) = 4 if and only if G contains K4 as its subgraph. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2005.01.008 |
| View Full Text View/Add Comment |
