摘要
本文讨论极小n-棱连通图的最小度点数。证明了:一个极小n-棱连通图至少有△(G)个度为n的点,其中△(G)指G中的最大度数。推广了文[1][2]的定理。
The paper discusses the number of minimum degree of minimally n-edge connected graphs, and the following theorem is proved: A minimally n-edge connected graph, has at least A(G) vertex of degree n, where Δ(G) denotes the maximum degree of G. This result has extended the main theorems in [1] and [2]
出处
《土木工程与管理学报》
1989年第3期61-64,共4页
Journal of Civil Engineering and Management
关键词
极小n-棱连通图
最小度点数
定理
minimally n-edge connected graphs
the number of minimum degree
theorem
