GRAPHS WITH NO INDUCED C-4 AND 2K2

We characterize the structure of graphs containing neither the 4-cycle nor its complement as an induced subgraph. This self-complementary cl ass G of graphs includes split graphs, which are graphs whose vertex s et is the union of a clique and an independent set. In the members of G, the number of cliques (as well as the number of maximal independent sets) cannot exceed the number of vertices. Moreover, these graphs ar e almost extremal to the theorem of Nordhaus and Gaddum (1956).