Assertion: graph | /r/HasProperty | kth power of another graph
Facets:
value: for a given number k ≥
type: OTHER
Source sentences:
text: Moreover, it is NP-complete to determine whether a graph is a kth power of another graph, for a given number k ≥ 2, or whether it is a kth power of a bipartite graph, for k > 2.