Structure of super strongly perfect graphs.

Super strongly perfect graphs and their association with certain other classes of graphs are discussed in this paper. It is observed that every split graph is super strongly perfect. An existing result on super strongly perfect graphs is disproved providing a counter example. It is also established that if a graph G contains a cycle of odd length, then its line graph L(G) is not always super strongly perfect. Complements of cycles of length six or above are proved to be non-super strongly perfect. If a graph is strongly perfect, then it is shown that they are super strongly perfect and hence all P 4 -free graphs are super strongly perfect. [ABSTRACT FROM AUTHOR]