摘要
设G是h连通的简单非完全图,v是G的顶点,若k(G—v)≥k(G),则称v是G的非临界点。关于G中非临界点的个数,Veldman和苏健基分别给定了在不同条件下的下界,本文推广了他们的结果,得到了更一般的下界。
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.
出处
《应用数学》
CSCD
北大核心
1995年第2期127-134,共8页
Mathematica Applicata
