| h连通图中非临界点的个数 |
| |
| 引用本文： | 周红卫. h连通图中非临界点的个数[J]. 应用数学, 1995, 8(2): 127-134 |
| |
| 作者姓名： | 周红卫 |
| |
| 作者单位： | 桂林医学院 541001 |
| |
| 摘 要： | 设Ｇ是ｈ连通的简单非完全图，ｖ中Ｇ的顶点，若ｋ（Ｇ－ｖ）≥ｋ（Ｇ），则称ｖ是Ｇ的非临界点，关于Ｇ中非临界点的个数，Ｖｅｌｄｍａｎ和苏健基分别给定了在不同条件下的下界，本文推广了他们的结果，得到了更一般的下界。
|
| 关 键 词： | 非临界点 连通图 连通度 割集 |
The Number of Non-Critical Vertices in h-Connected Graphs |
| |
| Zhou Hongwei. The Number of Non-Critical Vertices in h-Connected Graphs[J]. Mathematica Applicata, 1995, 8(2): 127-134 |
| |
| Authors: | Zhou Hongwei |
| |
| Abstract: | Let G be an h-connected noncomplete simple graph,a vertex v of G is called a non-critical vertex of G if k(G- v)>h. About the number of non-critical vertices of G,some low-bounds were given by Veldman and Su Jianji. In this paper,their results are generalized. |
| |
| Keywords: | Non-critical vertex Fragment End |
| 本文献已被 CNKI 维普 等数据库收录！ |
