Some classes of Trivially Perfect Graphs

Abstract

A graph G is supposed to be trivially perfect if, in each induced subgraph H of G, the number of maximal cliques in H equivalents to the size of a maximum independent set in H. Trivially perfect graphs is subclasses of notable perfect graphs and its characterization have numerous continuous applications and it is adequate to research its subclasses. Along with this idea, in this paper, it is discussed trivially perfect graphs on the windmill graph and demonstrated a few outcomes on trivially perfect graphs.