Assertion: undirected graph | /r/HasProperty | denoted by $g \cong h$
Facets:
Source sentences:
text: If two graphs G and H contain the same number of vertices connected in the same way, they are called isomorphic graphs (denoted by $G \cong H$).