Question 10711 – GATE 2007-IT
November 26, 2023Question 4 – ISRO-2018
November 26, 2023Question 3655 – UGC NET CS 2016 July- paper-2
The number of different spanning trees in complete graph, K 4 and bipartite graph, K 2,2 have ______ and _______ respectively.
Correct Answer: C
Question 2 Explanation:
Step-1: Given complete graph K 4 .To find total number of spanning tree in complete graph using standard formula is n (n-2)
Here, n=4
=n (n-2)
= 4 2
=16
Step-2: Given Bipartite graph K 2,2 . To find number of spanning tree in a bipartite graph K m,n having
standard formula is m (n-1) * n (m-1) .
m=2 and n=2
= 2 (2-1) * 2 (2-1)
= 2 * 2
= 4
Here, n=4
=n (n-2)
= 4 2
=16
Step-2: Given Bipartite graph K 2,2 . To find number of spanning tree in a bipartite graph K m,n having
standard formula is m (n-1) * n (m-1) .
m=2 and n=2
= 2 (2-1) * 2 (2-1)
= 2 * 2
= 4
14, 14
16, 14
16, 4
14, 4
Subscribe
Login
0 Comments