满足预定性质的图的构造

GRAPH CONSTRUCTION WITH PREDETERMINED PROPERTY

论述了对于任意一组满足不等式Ｋ（Ｇ）≤λ（Ｇ）≤δ（Ｇ）的三个整数，总有一个图与之相对应，该定理的证明给出了构造这种图的方法．并进一步讨论了满足条件的图中其最小图的顶点数．

In this paper, the author proves the existence of the graph corresponding with any set of three integers ( l,m,n ) which can satisfy the inequality 0<l≤m≤n, l=K(G), m=λ(G) , and n=δ(G) . Furthermore, a method to construct the graph is presented due to the proof of the theorem. And the number of vertices of the minimum graph among the graphs which satisfy the inequality 0<K(G)≤λ(G)≤δ(G) is discussed as well.