Assertion: graph's g | /r/HasProperty | same graph
Facets:
value: in the case
type: OTHER
Source sentences:
text: In the case when the bijection is a mapping of a graph onto itself, i.e., when G and H are one and the same graph, the bijection is called an automorphism of G.
text: In the case when the bijection is a mapping of a graph onto itself, i.e., when G and H are one and the same graph, the bijection is called an automorphism of G.