The graph K3,4 has:
A. 3 edges
B. 4 edges
C. 7 edges
D. 12 edges
Answer:D
The graph K3,4 has:
A. 3 edges B. 4 edges C. 7 edges D. 12 edges
Explanation: A bipartite graph is a complete bipartite graph if every vertex in U is connected to every vertex in V. If U has n elements and V has m, then the resulting complete bipartite graph can be denoted by Kn,m and the number of edges is given by n*m. The number of edges Kn,m = K 3,4