| 包含子图K_4的无割点次极大图的唯一性 |
| |
| 引用本文： | 林跃峰.包含子图K_4的无割点次极大图的唯一性[J].数学的实践与认识,2013,43(10). |
| |
| 作者姓名： | 林跃峰 |
| |
| 作者单位： | 漳州城市职业学院 经济管理系,福建 漳州,363000 |
| |
| 基金项目： | 福建省教育厅A类科技项目 |
| |
| 摘 要： | 研究次极大图(即链环分支数等于基圈数的连通平图)的唯一性.证明了无割点且包含子图K_4的连通平图G是次极大图当且仅当G同构于K_4,并刻画了包含子图K_4的次极大图的结构.
|
| 关 键 词： | 次极大图 K_4 链环分支数 基圈数 唯一性 结构 |
The Uniqueness of the Near-extremal Graphs with Subgraph K4 and no Cut Vertices |
| |
| LIN Yue-feng.The Uniqueness of the Near-extremal Graphs with Subgraph K4 and no Cut Vertices[J].Mathematics in Practice and Theory,2013,43(10). |
| |
| Authors: | LIN Yue-feng |
| |
| Abstract: | In this paper,we study the uniqueness of the near-extremal graphs(i.e.the connected plane graphs with link component number equal to the nullity).We prove that a connected plane graph with subgraph K_4 and no cut vertices is a near-extremal graph if and only if G is isomorphic to K_4,and depicts the structure of near-extremal graphs where the near-extremal graphs with subgraph K_4. |
| |
| Keywords: | near-extremal graphs K4 link component number nullity uniqueness structure |
| 本文献已被 万方数据 等数据库收录！ |
