Assertion: graph's edge | /r/CapableOf | touch each vertex
Facets:
Source sentences:
text: Q n has 2n vertices, 2n−1n edges, and is a regular graph with n edges touching each vertex.
text: Hypercube graphs should not be confused with cubic graphs, which are graphs that have exactly three edges touching each vertex.