Menu
If every induced sub graph \(H\) of a graph \(G\) contains a minimal dominating set that intersects every maximal cliques of \(H\), then \(G\) is SSP (super strongly perfect). This paper presents a cyclic structure of some circulant graphs and later investigates their SSP properties, while also giving attention to find the SSP parameters like colourability, cardinality of minimal dominating set and number of maximal cliques of circulant graphs.