Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

The number of distinct minimum spanning trees for the weighted graph below is _____

F1 Raju Shraddha 01.07.2020 D4

This question was previously asked in
GATE CS 2014 Official Paper: Shift 2
Attempt Online
View all GATE CS Papers >

Answer (Detailed Solution Below) 6
Free Tests
View all Free tests >
Free
GATE CS Full Mock Test
5.4 K Users
65 Questions 100 Marks 180 Mins
Start Now

Detailed Solution

Download Solution PDF

Concept:

  • Using Prim’s and Kruskal algorithm, we can find out minimum spanning tress.
  • If tree contains n vertices then minimum spanning will contain n vertices but n-1 edges.


Explanation:

Total 6 minimum spanning trees are possible:

Case 1:

F2 Raju Madhu 17.07.20 D11

Case 2:

F2 Raju Madhu 17.07.20 D12

Case 3:

F2 Raju Madhu 17.07.20 D13

Case 4:

F2 Raju Madhu 17.07.20 D14

Case 5:

F2 Raju Madhu 17.07.20 D15

Case 6:

F2 Raju Madhu 17.07.20 D16

Minimum spanning tree will have weight 11, hence 6 is the correct answer.

Download Solution PDF
Latest GATE CS Updates

Last updated on Jan 8, 2025

-> GATE CS 2025 Admit Card has been released on 7th January 2025.

-> The exam will be conducted on 1st February 2025 in 2 shifts.

-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.

-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.

-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.

More Spanning Trees Questions

Q1.In a directed acyclic graph with a source vertex s, the quality-score of a directed path is defined to be the product of the weights of the edges on the path. Further, for a vertex v other than s, the quality-score of v is defined to be the maximum among the quality-scores of all the paths from s to v. The quality-score of s is assumed to be 1. The sum of the quality-scores of all the vertices in the graph shown above is ______
Q2.Which of the following is not true for tree and graph?
Q3.The number of distinct minimum spanning trees for the weighted graph below is _____
Q4.Which one of the following property is correct for a red-black tree?
Q5.Consider the following undirected graph G: Choose a value for x that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is ______.

More Graph Theory Questions

Q1.Which of the following statements is/are TRUE for undirected graphs?
Q2.The largest number of faces in a simple connected maximal planar graph with 100 vertices is :
Q3.Which of the following Graph is/are planer? Choose the most appropriate answer from the options given below:
Q4.Arrange the following graph on the basis of number of edges in increasing order [for n > 3] A. Kn (Complete Graph) B. Cn (Cycle graph) C. Wn (Wheel graph) D. Kn, n (Complete Bipartite Graphs) E. Qn (n-cubes graph) Choose the correct answer from the options given below:
Q5.Which of the following graphs are trees ?  A.  B.  C.  D.  Choose the correct answer from the options given below :  
Q6.Statement 1: Given a graph G = (V, E) in which each vertex v ∈ V has an associated positive weight w(v), we can use linear programming to find the lower bound on the weight of the minimum-weight vertex cover. Statement 2: The lower bound can be found by maximizing the following \(\rm\sum_{v \in V}^n {w}(v) {x}(v)\) subject to x(u) + x(v) ≥ 1 for each (u, v) ∈ V x(v) ≤ 1 for each v ∈ V x(v) ≥ 0 for each v ∈ V In the light of the above statements, choose the most appropriate answer from the options given below:
Q7.Match List I with List II LIST - I LIST - II A. Planar Graph I. Probabilistic Model B. Bipartite Graph II. Deterministic Model C. PERT III. 4-Colorable D. CPM IV. 2-Colorable Choose the correct answer from the options given below:
Q8.Consider the following statements: P: There exists no simple, undirected and connected graph with 80 vertices and 77 edges. Q: All vertices of Euler graph are of even degree. R: Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one. S: There exits a bipartite graph with more than ten vertices which is 2-colorable. What is the number of correct statements among the above statements.
Q9.A principal node is a
Q10.A star connected network consumes a power of 20 kW with a power factor of 0.8. Calculate the value of resistance of each coil when a supply voltage of 230 volts and 50 Hz is supplied between two phases of the network.
Crack GATE CSE with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Test Series
View All >
GATE CSE 2023-24 Test Series
129 Total Tests with 1 Free Tests
Start Free Test
ISRO Scientist Computer Science Mock Test
22 Total Tests with   1 Free Tests
Start Free Test
Suggested Exams
Exam-Logo
GATE CS

GATE CS Important Links

More Engineering Mathematics Questions

Q1.If L = {1, 2, 3, 4, 6, 9, 36} is the lattice find the number of complements 9 is having in the below given Hasse diagram?
Q2.Which of the following statements is/are TRUE for undirected graphs?
Q3.\(\iint \frac{x y}{\sqrt{1-y^{2}}} d x d y\) Over the positive quadrant of the circle x2 + y2 = 1 is __________.
Q4.The real root of the equation x3 − x − 5 = 0 lying between 1 and 2 after first iteration by Newton-Raphson method is ________, if initial approximation is taken as x0 = 2 ∈ [1, 2] : 
Q5.Let X be uniform random variable on [0, 4] and Y be uniform random variable on [0, 1]. If X and Y are independent, then P(max {X, Y} > 3) is equal to : 
Q6.If R and D are the radius and diameter of the graph K4,7, then the ordered pair (R, D) is equal to : 
Q7.The largest number of faces in a simple connected maximal planar graph with 100 vertices is :
Q8.If for the matrix A, A3 = I then A−1 = __________. 
Q9.Energy of power signal is : 
Q10.With usual notations, the properties of maxima and minima under various conditions are __________. I II (P) Maxima (i) r t− s2 = 0 (Q) Minima (ii) rt − s2 < 0 (R) Saddle Point (iii) rt − s2 > 0, r > 0 (S)  Case of failure (iv) rt − s2 > 0, r < 0
Important Links for GATE Exam
Super Coaching
Branch wise Page
Test Series
Previous Year Papers
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： teen patti online game teen patti bliss teen patti noble