An introduction to the family members of the architecture Super Strongly Perfect Graph (SSP)
R. Mary Jeya Jothi, A. Amutha · 2011
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 namely, Wheel graph, Double Wheel graph, Cycles, Triangulated graphs and Circulant graphs.