An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s and (ii) non-diagonal elements are 1‘s. which one of the following is TRUE?
  • a)
    Graph G has no minimum spanning tree (MST)
  • b)
    Graph G has a unique MST of cost n-1
  • c)
    Graph G has multiple distinct MSTs, each of cost n-1
  • d)
    Graph G has multiple spanning trees of different costs
Correct answer is option 'C'. Can you explain this answer?

Related Test

Can you answer this doubt?

People are searching for an answer to this question.
This discussion on An undirected graph G has n nodes. Its adjacency matrix is given by an n n square matrix whose (i) diagonal elements are 0s and (ii) non-diagonal elements are 1s. which one of the following is TRUE?a)Graph G has no minimum spanning tree (MST)b)Graph G has a unique MST of cost n-1c)Graph G has multiple distinct MSTs, each of cost n-1d)Graph G has multiple spanning trees of different costsCorrect answer is option 'C'. Can you explain this answer? is done on EduRev Study Group by Computer Science Engineering (CSE) Students. The Questions and Answers of An undirected graph G has n nodes. Its adjacency matrix is given by an n n square matrix whose (i) diagonal elements are 0s and (ii) non-diagonal elements are 1s. which one of the following is TRUE?a)Graph G has no minimum spanning tree (MST)b)Graph G has a unique MST of cost n-1c)Graph G has multiple distinct MSTs, each of cost n-1d)Graph G has multiple spanning trees of different costsCorrect answer is option 'C'. Can you explain this answer? are solved by group of students and teacher of Computer Science Engineering (CSE), which is also the largest student community of Computer Science Engineering (CSE). If the answer is not available please wait for a while and a community member will probably answer this soon. You can study other questions, MCQs, videos and tests for Computer Science Engineering (CSE) on EduRev and even discuss your questions like An undirected graph G has n nodes. Its adjacency matrix is given by an n n square matrix whose (i) diagonal elements are 0s and (ii) non-diagonal elements are 1s. which one of the following is TRUE?a)Graph G has no minimum spanning tree (MST)b)Graph G has a unique MST of cost n-1c)Graph G has multiple distinct MSTs, each of cost n-1d)Graph G has multiple spanning trees of different costsCorrect answer is option 'C'. Can you explain this answer? over here on EduRev! Apart from being the largest Computer Science Engineering (CSE) community, EduRev has the largest solved Question bank for Computer Science Engineering (CSE).
This discussion on An undirected graph G has n nodes. Its adjacency matrix is given by an n n square matrix whose (i) diagonal elements are 0s and (ii) non-diagonal elements are 1s. which one of the following is TRUE?a)Graph G has no minimum spanning tree (MST)b)Graph G has a unique MST of cost n-1c)Graph G has multiple distinct MSTs, each of cost n-1d)Graph G has multiple spanning trees of different costsCorrect answer is option 'C'. Can you explain this answer? is done on EduRev Study Group by Computer Science Engineering (CSE) Students. The Questions and Answers of An undirected graph G has n nodes. Its adjacency matrix is given by an n n square matrix whose (i) diagonal elements are 0s and (ii) non-diagonal elements are 1s. which one of the following is TRUE?a)Graph G has no minimum spanning tree (MST)b)Graph G has a unique MST of cost n-1c)Graph G has multiple distinct MSTs, each of cost n-1d)Graph G has multiple spanning trees of different costsCorrect answer is option 'C'. Can you explain this answer? are solved by group of students and teacher of Computer Science Engineering (CSE), which is also the largest student community of Computer Science Engineering (CSE). If the answer is not available please wait for a while and a community member will probably answer this soon. You can study other questions, MCQs, videos and tests for Computer Science Engineering (CSE) on EduRev and even discuss your questions like An undirected graph G has n nodes. Its adjacency matrix is given by an n n square matrix whose (i) diagonal elements are 0s and (ii) non-diagonal elements are 1s. which one of the following is TRUE?a)Graph G has no minimum spanning tree (MST)b)Graph G has a unique MST of cost n-1c)Graph G has multiple distinct MSTs, each of cost n-1d)Graph G has multiple spanning trees of different costsCorrect answer is option 'C'. Can you explain this answer? over here on EduRev! Apart from being the largest Computer Science Engineering (CSE) community, EduRev has the largest solved Question bank for Computer Science Engineering (CSE).