摘要
介绍λk最优图的概念,通过考察图中顶点的邻域和k阶连通子图之间的关系,给出了图是λk最优的一些充分条件.
λk-optimal graphs are introduced and sufficient conditions for a graph to be λk- optimal are given by studying the relationship between the neighborhood of vertices and the connected subgraphs with order k.
出处
《数学的实践与认识》
CSCD
北大核心
2008年第12期208-213,共6页
Mathematics in Practice and Theory
基金
国家自然科学基金资助项目(60773131)
关键词
边割
限制边连通度
邻域
edge cut
restricted edge connectivity
neighborhood
