Assertion: graph's g | /r/Synonym | balanced bipartite graph
Facets:
Source sentences:
text: If | U | = | V | {\displaystyle |U|=|V|} , that is, if the two subsets have equal cardinality, then G {\displaystyle G} is called a balanced bipartite graph.