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?
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 ______