| Chinese Abstract | 第1-9页 |
| English Abstract | 第9-14页 |
| 1 Introduction and Notations | 第14-20页 |
| ·Introduction to Matching Theory | 第15-16页 |
| ·Concepts and Terminology | 第16-17页 |
| ·Some Known Results on Induced Matching Extendable Graphs | 第17-19页 |
| ·The Main Results of the Thesis | 第19-20页 |
| 2 Induced Matching Extendability of Claw-free Graphs of Diameter 2 | 第20-26页 |
| ·Main Results | 第21-25页 |
| ·Algorithm and its Correctness | 第25-26页 |
| 3 Induced Matching Extendability of the Composition of Two Graphs | 第26-31页 |
| 4 Characterization of the Induced Matching Extendable Graphs with 2n Vertices and 3n-1 Edges | 第31-41页 |
| ·Preliminaries | 第32-33页 |
| ·Main Results and Proofs | 第33-41页 |
| 5 Characterization of the Induced Matching Extendable Graphs with 2n Vertices and 3n Edges | 第41-65页 |
| ·Preliminaries | 第42-43页 |
| ·Main Results and Proofs | 第43-65页 |
| 6 Characterization of the Induced Matching Extendability of the Square of Trees | 第65-69页 |
| ·Proof of the theorem | 第66-69页 |
| Acknowledgement | 第69-70页 |
| References | 第70-72页 |
