Assertion: graph | /r/HasProperty | complete
Facets:
value: in this case
type: OTHER
value: transitively
type: DEGREE
Source sentences:
text: An example of this type of directed acyclic graph are those encountered in the causal set approach to quantum gravity though in this case the graphs considered are transitively complete.
text: When each vertex is connected by an edge to every other vertex, the graph is called a complete graph.
text: " Now that your graph is complete, you can print, save, and email your graph, or you can start a new graph.
text: For a graph to be "complete" we need to show all the important features.
text: …the graph is called a complete graph (Figure 13B).
text: A graph is called complete graph if every two vertices pair are joined by exactly one edge.