SSP Structure of Circular Ladder Graphs

A graph G is SSP (Super Strongly Perfect) if in every induced subgraph H of G there exists a minimal dominating set that covers every maximal cliques of H. This paper analyses the SSP ness in circular ladder graphs. Also, it finds the SSP parameters (number of elements of minimal dominating set, cardinality of maximal cliques and colourability) of circular ladder graphs.