SSP-structural analysation of dragons

摘要

If all sub graph (induced) H of a graph G admits a MDS which covers every cliques (maximal) of H, then it is said to be Super Strongly Perfect (SSP). This paper investigates the structure of SSP on dragon graph. With this investigation, it is found the SSP parameters of the above graph.