A graph is SSP (Super Strongly Perfect) if all of its (induced) subgraph H in G obsesses a (minimal dominating set) MDS that link up all of its cliques (maximal) in H. It is offered the cyclic structure of k-sun flower graph, friendship and Jahangir graphs and later explored their SSP parameters like counting of colourability, MDS (minimal dominating set) and cliques (maximal) of these graphs.

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 investigated the characterization of Super Strongly Perfect graphs using odd cycles. We have given the characterization of Super Strongly Perfect graphs in chordal and strongly chordal graphs. We have presented the results of Chordal graphs in terms of domination and co - domination numbers γ and . We have given the relationship between diameter, domination and co - domination numbers of chordal graphs. Also we have analysed the structure of Super Strongly Perfect Graph in Chordal graphs and Strongly Chordal graphs.

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.

Network is the engineering discipline concerned with the communication between computer systems or devices. A computer network is any set of computers or devices connected to each other with the ability to exchange data. Computers on a network are sometimes called nodes. Networks can be broadly classified as using graphs. In the most common sense of the term, a graph is an ordered pair G = (V, E) comprising a set V of vertices or nodes together with a set E of edges or lines, which are 2-element subsets of V. In graph theory, we have many architectures namely Complete graph, Regular graph, Petersen graph, Trees etc. Here we have analyzed one of the new architecture Super Strongly Perfect Graph (SSP). By investigating, we have classified some of its family members

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 cliques of H. The structure of Super Strongly Perfect Graphs have been characterized by some classes of graphs like Cycle graphs, Circulant graphs, Complete graphs, Complete Bipartite graphs etc., In this paper, we have analysed some other graph classes like, Bicyclic graphs, Dumb bell graphs and Star graphs to characterize the structure of Super Strongly Perfect Graphs in a different way. By this we found the cardinality of minimal dominating set and maximal cliques of the above graphs.