Multiple choice

A undirected graph G has n nodes. Its adjacency matrix is given by by an n x n square matrix whose

  1. diagonal elements are O's, and
  2. non-diagonal elements are 1's. Which one of the following is TRUE?

  1. Graph G has no minimum spanning tree (MST)

  2. Graph G has a unique MST of cost in-1

  3. Graph G has multiple distinct MST's, each of cost n-1

  4. Graph G has multiple spanning trees of different costs
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Keep practicing — related questions