摘要
设 G为 k-连通图且不存在非平凡的 k-点割 ,则称 G为拟 ( k+ 1 ) -连通图 ,给出了拟 ( k+ 1 ) -连通图的一些类似于 ( k+ 1 )
Let G be a k-connected graph and S be a k-vertex-cut of G.It says that S is a nontrivial k-vertex-cut of G,if the components of G-S can be partitioned into subgraphs G 1 and G 2 such that |V(G 1)|≥2 and |V(G 2)|≥2.A k-connected graph is quasi (k+1)-connected if it has no nontrivial k-vertex-cut.This paper proves some properties of quasi (k+1)-connected graphs.
出处
《广西师范大学学报（自然科学版）》
CAS
2001年第4期26-29,共4页
Journal of Guangxi Normal University:Natural Science Edition
基金
国家自然科学基金资助项目 ( 1 95 6 1 0 0 1 )
