Complete bipartite graph Guide, Meaning , Facts, Information and Description

In mathematics, a complete bipartite graph is a simple undirected graph with the property that its vertices can be divided into two non-empty groups, A and B. Each vertex in A is connected to B, and vice-versa. There are no other edges.

Notation for this is K_m,n, where m and n are the numbers of vertices in sets A and B.

Here is an example of K_2,3:

Note that a planar graph cannot contain K_3,3.

This is an Article on Complete bipartite graph. Page Contains Information, Facts Details or Explanation Guide About Complete bipartite graph

	Web www.E-paranoids.com