关于几类Menger型图

On Some Menger-type Graphs

设Ｇ是一个简单图．若分离Ｇ的任一独立集Ｓ的最小点数等于连接Ｓ的点之间的内部不相交路的最大个数，则称Ｇ是Ｍｅｎｇｅｒ型图．本文讨论了几类Ｍｅｎｇｅｒ型图．

Let G be a simple graph. If the minimum number of points separating any independent set S of G is equalto the maximum number of disjoint paths between the points of S,then G is called a Menger-type graph. Weconsider some operations on graphs and prove that P_n× K_2,S_m× K_t and P are Menger-type graphs.