On the Graph Join of Two Graph Classes of SSP Graphs
R. Mary Jeya Jothi, D. Angel, S. Emalda Roslin · 2024
Graphs operations such as join, addition, Cartesian product, tensor product, etc. always play an important role in data structure. Forever, Operations on any two graphs produce a new set of graphs which sometimes preserve the structure of either the first graph or the second graph or both the graphs. Any graph where each H (induced subgraph) of G has a dominating set of cardinalities (minimal) that cuts through all of H’s cliques (maximal) is known as a SSPG (Super Strongly Perfect Graph). It has been analyzed many classes of SSP structured graph classes like complete, path, etc. This paper investigates a graph join of two SSP graphs which includes complete and path graphs. Also, it is very interesting to find the SSP parameters for this graph join Lollipop graphs.