An Acyclic SSP Structure of Grid Graphs
R. Mary Jeya Jothi · 2023
A Super Strongly Perfect Graph (SSPG) is a graph in which every H (induced subgraph) of G has a dominating set of cardinality (minimal) that cut all cliques (maximal) of H. Here, it is examined the grid graphs and its super strongly perfect ness. And it is obstinated the diameter, domination, co - domination numbers of grid graphs.