Super Strongly Perfect Structure of Mobius Ladder Graphs
R. Mary Jeya Jothi, R. Revathi · 2018 International Conference on Current Trends towards Converging Technologies (ICCTCT) · 2018
A graph G is SSP (Super Strongly Perfect) if in every induced subgraph H of G there exists a dominating set which is minimal that covers every maximal cliques of H. This paper investigates the SSP ness in Mobius ladder graphs. Also, it discusses the SSP parameters (number of elements of minimal dominating set, cardinality of cliques with maximality and colourability) of Mobius ladder graphs.