A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meet all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super strongly perfect graphs in some inter connection networks like Butterfly, Wrapped Butterfly and Benes Networks. We have given the characterization of Super Strongly Perfect graphs in Butterfly, Wrapped Butterfly and Benes Networks. Also we have investigated the relationship between diameter, domination and co - domination numbers of Butterfly, Wrapped Butterfly and Benes Networks.