An investigation on the structure of super strongly perfect graphs on trees

Abstract

A graph G is super strongly perfect graph if every induced subgraph H of G possesses a minimal dominating set that meets all the maximal cliques of H. In this paper, we have characterized the super strongly perfect graphs on trees. We have presented the results on trees in terms of domination and codomination numbers γ and γ. Also, we have given the relationship between diameter, domination, and codomination numbers in trees.