Awesome q2a theme
0 votes
3 views

If a graph contains n vertices then in minimum spanning tree(MST) will contain

  1. Minimum(n-1) edges
  2. Exact (n-1) edges.

What will be the answer for this?? Plz explain with example for better understanding.

in Algorithms by (5 points) | 3 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,270 questions
3,204 answers
14,751 comments
96,304 users