图是超级-λ_3的邻域条件  

Neighborhood Conditions for Graphs to be Super-λ_3

作　　者：周宏强[1] 高敬振[1] 

机构地区：[1]山东师范大学数学科学学院,济南250014

出　　处：《科学技术与工程》2010年第35期8649-8652,共4页Science Technology and Engineering

基　　金：国家自然科学基金(10901097)资助

摘　　要：设G是有限简单无向图,k是正整数,使G-S的每个分支都包含至少k个点的边割S称为G的k-限制边割。若任意最小k-限制边割都孤立一个k阶连通子图,则称图G是超级-λk的。应用邻域条件给出了图是超级-λ3的充分条件。For a finite,simple and undirected graph G,an edge-cut S is called a k-restricted edge-cut of G if every component of G-S has at least k vertices.G is super-λk if every minimum k-restricted edge-cut isolates a connected subgraph of order k.Some neighborhood sufficient conditions for graphs to be super-λ3 are shown.

关 键 词：3-限制边连通度 超级-λ3图 邻域条件 

分 类 号：O157.5[理学—数学]