| λ_k最优图的充分条件 |
| |
| 引用本文： | 林上为,王世英,李春芳.λ_k最优图的充分条件[J].数学的实践与认识,2008,38(12):208-213. |
| |
| 作者姓名： | 林上为 王世英 李春芳 |
| |
| 作者单位： | 1. 山西大学,数学科学学院,山西,太原,030006
2. 晋中学院,数学系,山西,晋中,030600 |
| |
| 摘 要： | 介绍λk最优图的概念,通过考察图中顶点的邻域和k阶连通子图之间的关系,给出了图是λk最优的一些充分条件.
|
| 关 键 词： | 边割 限制边连通度 邻域 |
| 修稿时间： | 2008年1月1日 |
Sufficient Conditions for,λk-Optimal Graphs |
| |
| LIN Shang-wei,WANG Shi-ying,LI Chun-fang.Sufficient Conditions for,λk-Optimal Graphs[J].Mathematics in Practice and Theory,2008,38(12):208-213. |
| |
| Authors: | LIN Shang-wei WANG Shi-ying LI Chun-fang |
| |
| Abstract: | λ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. |
| |
| Keywords: | edge cut restricted edge connectivity neighborhood |
| 本文献已被 万方数据 等数据库收录！ |
|
