Assertion: complete bipartite graph | /r/HasProperty | k m
Facets:
Source sentences:
text: Another class of graphs is the collection of the complete bipartite graphs K m, n , which consist of the simple graphs that can be partitioned into two independent sets of m and n vertices such that there are no edges between vertices within each set and every vertex in one set is connected by an edge to every vertex in the other set.