trivially perfect graph
graph where every connected induced subgraph has a universal vertex
threshold graph
graph that can be constructed with a sequence of operations that add either an isolated vertex or a dominating vertex
windmill graph
undirected graph constucted by joining multiple complete graphs at a shared universal vertex