The graph K₃,₄ has:
2008
The graph K₃,₄ has:
- A.
3 edges
- B.
4 edges
- C.
7 edges
- D.
12 edges
Attempted by 78 students.
Show answer & explanation
Correct answer: D
The graph K₃,₄ is a complete bipartite graph with partition sets of size 3 and 4. In such graphs, the number of edges is calculated by multiplying the sizes of the two partitions together. Therefore, K₃,₄ has 3 multiplied by 4, which equals 12 edges total.
A video solution is available for this question — log in and enroll to watch it.