Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
|Answer» B. complete bipartite|
|Explanation: the graph is known as bipartite if the graph does not contain any odd length cycle in it. the complete bipartite graph has all the vertex of first set connected to all the vertex of second set.|
Login to Continue
It will take less than 2 minutes