Points In The Combined Star Chart Does Not Cross The Road Problems

In this paper, we consider the one-to-many node-disjoint paths problem and t-pairwise node- disjoint paths problem in Corn-Star graph. For the first problem, we using two ways to solve it. By using the inductive technique, it is proved that one can construct n-i node-disjoint paths from a given node to eadh node in a set A of any given n-1 distinct nodes in CS (Corn-Star graph with dimension n and order k). And by using some results of Corn-Star graph, we get the result of constructing n-I node- disjoint paths from one given node to n-I given nodes in CS?Then it is proved that Corn-Star CS satisfies A/(, 1) 2J The two results are optimal, and their obtaining demonstrate the strong faulty tolerance feature of the Corn-Star graph.