SUPER STRONGLY PERFECT NESS OF SOME INTERCONNECTION NETWORKS

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. In this paper we have analyzed the structure of super strongly perfect graphs in some Interconnection Networks, like Mesh, Torus, Hyper cubes and Grid Networks. Along with this investigation, we have characterized the Super Strongly Perfect ness in Mesh, Torus, Hyper cubes and Grid Networks. Also we have given the relationship between diameter, domination and co - domination numbers of Mesh, Torus, Hyper cubes and Grid Networks.