Maximum Nonseparating Independent Sets Of Circular Graphs

In this dissertation,we study the problem of the maximum nonseparating independent sets of circular graphs.The maximum nonseparating independent set problem is a dual version of the minimum connected vertex cover set problem.In the case of l = 2,3,4,5,we get the maximum nonseparating independent sets.In the case of n = 3k,l = 3m-1,(k,m)= 1,where k ? 3m and n = 3k,l = 3m-1,(k,m)= 2,where k ? 3m,after discussion we also have the results.