Consider a simple undirected weighted graph G, all of whose edge weights are distinct. Which of the following statements about the minimum spanning trees of G is/are TRUE?
The following simple undirected graph is referred to as the Peterson graph.
Which of the following statements is/are TRUE?
The following graph is isomorphic to the Peterson graph.
Which of the properties hold for the adjacency matrix A of a simple undirected unweighted graph having n vertices?
Let G be a connected undirected weighted graph. Consider the following two statements.
S1: There exists a minimum weight edge in G which is present in every minimum spanning tree of G.
S2: If every edge in G has distinct weight, then G has a unique minimum spanning tree. Which one of the following options is correct?