| Abstract(inChinese) | 第1-8页 |
| Abstract | 第8-12页 |
| Contents | 第12-15页 |
| 1 Introduction | 第15-33页 |
| ·Backgrounds and Notations | 第15-27页 |
| ·Problems and Observations | 第27-30页 |
| ·Overview of Results | 第30-33页 |
| 2 Basic Results for Neighbor-Scattering Number of Graphs | 第33-51页 |
| ·Introduction | 第33-35页 |
| ·NP-Completeness Results | 第35-38页 |
| ·Lower and Upper Bounds for Neighbor-Scattering Number of Graphs | 第38-43页 |
| ·Neighbor-Scattering Number of Disjoint Union and Join of Two Graphs | 第43-48页 |
| ·Discussion and an Open Question | 第48-51页 |
| 3 Neighbor-Scattering Number in Regular Graphs | 第51-63页 |
| ·Introduction | 第51-52页 |
| ·A Class of m-Neighbor-Scattered Graphs | 第52-55页 |
| ·Preliminary Results | 第55-57页 |
| ·Optimal Cut-Strategies | 第57-60页 |
| ·Main Result | 第60-63页 |
| 4 The Size of a Minimum Critically m-Neighbor-Scattered Graph | 第63-81页 |
| ·Introduction | 第63-64页 |
| ·A Class of Critically m-Neighbor-Scattered Graphs | 第64-70页 |
| ·The Size of a Minimum Critically m-Neighbor-Scattered Graph | 第70-80页 |
| ·Conclusion | 第80-81页 |
| 5 The Neighbor-Scattering Number for Interval Graphs Can #Be Computed in Polynomial Time | 第81-95页 |
| ·Introduction | 第81-82页 |
| ·Minimal Cut-Strategy and Neighbor-Scattering Number | 第82-86页 |
| ·Neighbor-Scattering Number for Interval Graphs | 第86-94页 |
| ·Discussion and an Open Question | 第94-95页 |
| 6 Computing the Rupture Degree of Graphs | 第95-111页 |
| ·Introduction | 第95-98页 |
| ·NP-Completeness Results | 第98-99页 |
| ·Rupture Degree of the Cartesian Product of Two Special Graphs | 第99-102页 |
| ·Rupture Degree of Harary Graphs | 第102-109页 |
| ·Another Result | 第109-110页 |
| ·Conclusion | 第110-111页 |
| 7 Computing the Tenacity and Rupture Degree for Permutation Graphs of Complete Bipartite Graphs | 第111-123页 |
| ·Introduction | 第111-112页 |
| ·Tenacity and Rupture Degree for the Permutation Graphs of Complete Bipartite Graphs | 第112-123页 |
| Acknowledge | 第123-125页 |
| Biblography | 第125-131页 |
| Resume | 第131页 |
