An overview of SSP structure analysis on a few graphs classes
R. Mary Jeya Jothi · 2025
Many important families of graphs in the field of theory of graphs, a division of mathematics, could be identified by a small number of particular graphs. G is called an SSPG (Super Strongly Perfect Graphs) if each subgraph H which is induced of G consumes a minimal dominating set with an intersection that is not empty with all maximal cliques of H. Numerous subclasses of popular graphs have been used to brand the building of SSPG. Here, it is estimated some additional graph classes like, Web, Gear and Friendship graphs to portray the construction of SSP Graphs. Also, it is originated the SSPG constraints(parameters) of the above graphs.