Assertion: cycle graph | /r/HasProperty | c n
Facets:
Source sentences:
text: Note that path graph, P n , has n-1 edges, and can be obtained from cycle graph, C n , by removing any edge.
text: The cycle graph with n vertices is called C n .