Assertion: dual graph | /r/HasAspect | 2n − 2 edges
Facets:
value: exactly
type: DEGREE
Source sentences:
text: It follows from Euler's formula that every self-dual graph with n vertices has exactly 2n − 2 edges.