摘要
利用Atom的概念和Halin定理的几个结果,对n-连通图中非基本的数目做了估计,以γ(G)表示图G中非基本边的数目,得到了关于γ(G)的3个定理,其中定理1是Halin定理的推广。
The number of non-critical edges in n-connected graphs is etstimated by using the concept of Atom and some results of Halin Theorem. Let γ(G) denote the number of non-critical edges in a graph G, then three theorems of γ(G) are obtained, and the theorem 1 extends Halin Theorem.
出处
《山东建材学院学报》
1992年第3期54-57,共4页
Journal of Shandong Institute of Building Materials
关键词
n-连通图
非基本边
图论
n-connected graph
non-critical edge
minimum vertex cut