Let G be a simple connected graph. If the minimum number of points separating any independent set S of points in G is the maximum number of disjoint paths between the points of S. then G is called a Monger's graph. We consider some composition graphs and give conditions for them to be Menger's graphs.
京公网安备11010802024621