SSP-Structure of k-Sun Flower, Friendship and Jahangir Graphs
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. It is offered the cyclic structure of k-sun flower graph, friendship and Jahangir graphs and later explored their SSP parameters like counting of colourability, MDS (minimal dominating set) and cliques (maximal) of these graphs.