Assertion: threshold graph | /r/HasProperty | graph
Facets:
Source sentences:
text: The threshold graphs are the graphs formed by repeatedly adding either an independent vertex (one with no neighbors) or a universal vertex (adjacent to all previously-added vertices).