Assertion: graph's edge | /r/CapableOf | connect same two vertices
Facets:
Source sentences:
text: The dual of a simple graph need not be simple: it may have self-loops (an edge with both endpoints at the same vertex) or multiple edges connecting the same two vertices, as was already evident in the example of dipole multigraphs being dual to cycle graphs.