SSP-Structure of Closed Helm and Flower Snark Graph Families
R. Mary Jeya Jothi, R. Revathi, D Angel · Journal of Physics Conference Series · 2021
Abstract A graph is SSP (Super Strongly Perfect) if all of its (induced) subgraph H in G obsesses a (minimal dominating set) MDS that link up all of its cliques (maximal) in H. In this paper, SSP Structure along with its parameters (counting of maximal cliques, cardinality of dominating set (Minimal) and colourability of closed Helm graph is analysed and also Flower snark graph families are investigated.