Author:
Gandal G. R.,Mary Jeya Jothi R.
Abstract
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.
Subject
General Physics and Astronomy
Reference4 articles.
1. Classes of Very Strongly Perfect Graphs;Ganesh;International Journal of Pure and Applied Mathematics,2017
2. Strongly perfect product of Graphs;Mandrescu;Czechoslovak Math.J.41,1991
3. A discussion on SSP Structure of Pan, Helm and Crown Graphs;Mary Jeya Jothi;ARPN Journal of Engineering and Applied Sciences,2015
4. Strong Perfectness of the generalized Cartesian product of graphs;Kwasnik;Discrete Mathematics,1997