Question 10192 – Operating-Systems
January 20, 2024Question 6025 – UGC NET CS 2008 Dec-Paper-2
January 20, 2024Question 6023 – UGC NET CS 2008 Dec-Paper-2
The graph K3,4 has :
Correct Answer: D
Question 2 Explanation:
The graph K3,4 means it complete bipartite graph with m=4 and n=3
Total number of vertices= n + m
Total number of edges= m*n
Example:
Total number of vertices= n + m
Total number of edges= m*n
Example:
3 edges
4 edges
7 edges
12 edges
Subscribe
Login
0 Comments