Assertion: graph | /r/Synonym | unlabeled
Facets:
value: consequently
type: MANNER
Source sentences:
text: Consequently, graphs in which vertices are indistinguishable and edges are indistinguishable are called unlabeled.