摘要
图G的粘连度定义为T(G)=min{[|X|+m(G-X)]/[ω(G-X)]:XV(G),且ω(G-X)>1}。本文我们在考虑图的粘连度的界的基础上指出了其取值范围,随后讨论了顶点数和粘连度给定的最大图的边数,并给出了该图的构造方法。
The tenacity of an incomplete connected graph G is defined as T（G）=min{[｜X｜＋m（G-X）]/[ω（G-X）]：XV（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.
出处
《工程数学学报》
CSCD
北大核心
2008年第1期138-142,共5页
Chinese Journal of Engineering Mathematics
基金
The science foundation of the Ministry of Education (206156)
关键词
粘连度
最大网络
非线性整数规划
the tenacity
maximum network
nonlinear integer programming
