Match LIST-I with LIST-II

Choose the correct answer from the options given below:
Step 1: Analyze Graphs and Adjacency Matrices.
An adjacency matrix represents graph connections (edges). A '1' signifies an edge between nodes; a '0' indicates no connection.
Step 2: Correlate Graphs with Adjacency Matrices.
- A: Graph A matches adjacency matrix I due to identical connectivity patterns.
- B: Graph B corresponds to adjacency matrix II based on its node connection pattern.
- C: Graph C aligns with adjacency matrix III based on its structural connections.
- D: Graph D corresponds to adjacency matrix IV due to the observed node interconnections.
Step 3: Final Matching.
The definitive correspondence is A - I, B - II, C - III, D - IV.
Let \( G \) be a simple, unweighted, and undirected graph. A subset of the vertices and edges of \( G \) are shown below.

It is given that \( a - b - c - d \) is a shortest path between \( a \) and \( d \); \( e - f - g - h \) is a shortest path between \( e \) and \( h \); \( a - f - c - h \) is a shortest path between \( a \) and \( h \). Which of the following is/are NOT the edges of \( G \)?
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below: