e/Quasi-threshold graph

Information
has gloss	eng: In graph-theoretic mathematics, a quasi-threshold graph is a graph that can be constructed using the following rules: #K1 is a quasi-threshold graph #If G is a quasi-threshold graph, then so is the graph obtained by adding a new vertex connected to every vertex in G. #The disjoint union of two quasi-threshold graphs is a quasi-threshold graph.
lexicalization	eng: quasi-threshold graph
instance of	c/Graph families