| 1 Introduction | 第1-8页 |
| ·Background | 第6-7页 |
| ·Symmetric Graphs | 第7页 |
| ·Imprimitive Blocks | 第7-8页 |
| 2 Graphs with Higher Order Edge Connectedness | 第8-40页 |
| ·Model and Notation | 第8-10页 |
| ·Super Edge Connectedness of Infinite Circulants | 第10-14页 |
| ·Optimally-λ~(3) Edge Transitive Graphs | 第14-27页 |
| ·The Existence of λ~(3) | 第14-15页 |
| ·Atoms of 3-Restricted Edge Connectivity | 第15-25页 |
| ·Optimally-λ~(3) Property of Edge Transitive Graphs | 第25-27页 |
| ·Optimally-λ~(3) Vertex Transitive Graphs | 第27-35页 |
| ·Optimally-λ~(3) Vertex Transitive Graphs | 第27-31页 |
| ·Optimally-λ~(3) Minimal Cayley graphs | 第31-35页 |
| ·A Sufficient Condition | 第35-40页 |
| 3 Graphs with Higher Order Vertex Connectedness | 第40-55页 |
| ·Super-and Hyper-Connected Edge Transitive | 第41-48页 |
| ·Notation and Preliminaries | 第41-45页 |
| ·Characterization | 第45-48页 |
| ·Semi-Hyper Connected Edge Transitive Graphs | 第48-55页 |
| ·Preliminary Results | 第49-51页 |
| ·Edge and Vertex Transitive Graphs | 第51-53页 |
| ·Edge Transitive but Not Vertex Transitive Graphs | 第53-55页 |
| 4 Tree Decomposition | 第55-66页 |
