A connected graph G is totally segregated if every pair of adjacent vertices has distinct degrees. In this article, the class of graphs called co-segregated graphs which are complements of totally segregated graphs is discussed and some basic results and properties of such graphs are presented. Major work in this paper is finding of minimum size of some class of co-segregated graph.

segregated graph: co-segregated graph, minimum size of co-segregated graph