Source: wikibot/trivially-perfect-graph
= Trivially perfect graph
{wiki=Trivially_perfect_graph}
A trivially perfect graph is a special type of graph characterized by its cliques and independent sets. Specifically, a graph \\( G \\) is defined as trivially perfect if every induced subgraph of \\( G \\) has a clique that is also a maximum independent set.