A Graph G is Super Strongly Perfect Graph if every induced sub graph H of
G possesses a minimal dominating set that meets all the maximal complete sub
graphs of H. Bipartite graphs, Complete graphs etc., are some of the most
important classes of Super Strongly Perfect graphs. Here, we summarize the results
concerning Super Strongly Perfect graphs. We investigate some classes of Super
Strongly Perfect graphs and we investigate the structure of Super Strongly Perfect
Graphs.