Structural properties of super strongly perfect graphs

Abstract

A graph [Formula: see text] is super strongly perfect if every induced subgraph [Formula: see text] of [Formula: see text] possesses a minimal dominating set meeting all the maximal cliques of [Formula: see text]. Different structural properties of super strongly perfect graphs are studied in this paper. Some of the special categories of super strongly perfect graphs are identified and characterized. Certain operations of super strongly perfect graphs are also discussed towards the end.