| 图的粘连度与最大网络 |
| |
| 引用本文： | 李银奎,王青宁. 图的粘连度与最大网络[J]. 工程数学学报, 2008, 25(1): 138-142 |
| |
| 作者姓名： | 李银奎 王青宁 |
| |
| 作者单位： | 青海民族学院数学系,西宁,810007;青海民族学院数学系,西宁,810007 |
| |
| 基金项目： | The science foundation of the Ministry of Education (206156) |
| |
| 摘 要： | 图G的粘连度定义为T(G)=min{[|X| m(G-X)]/[ω(G-X)]:XV(G),且ω(G-X)>1}。本文我们在考虑图的粘连度的界的基础上指出了其取值范围,随后讨论了顶点数和粘连度给定的最大图的边数,并给出了该图的构造方法。
|
| 关 键 词： | 粘连度 最大网络 非线性整数规划 |
| 文章编号： | 1005-3085(2008)01-0138-05 |
| 修稿时间： | 2005-02-06 |
Tenacity and the Maximum Network |
| |
| LI Yin-kui,WANG Qing-ning. Tenacity and the Maximum Network[J]. Chinese Journal of Engineering Mathematics, 2008, 25(1): 138-142 |
| |
| Authors: | LI Yin-kui WANG Qing-ning |
| |
| Abstract: | The tenacity of an incomplete connected graph G is defined as T(G) = min{|X|+m(G-X)/ω(G-X):X(∪)V(G)ω(G-X)＞1}. In this paper, we obtain the maximum network with a prescribed order and tenacity and give a method for constructing such networks. |
| |
| Keywords: | the tenacity maximum network nonlinear integer programming |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
