Assertion: graph's g | /r/CapableOf | discuss the dual of a graph
Facets:
value: g, the graph
type: OTHER
Source sentences:
text: The term "dual" is used because the property of being a dual graph is symmetric, meaning that if H is a dual of a connected graph G, then G is a dual of H. When discussing the dual of a graph G, the graph G itself may be referred to as the "primal graph".