Assertion: undirected graph | /r/HasProperty | isomorphic
Facets:
Source sentences:
text: Note that all strongly isomorphic graphs are isomorphic, but not vice versa.
text: The computational problem of determining whether two finite graphs are isomorphic is called the graph isomorphism problem.