Question:medium

Match LIST-I with LIST-II 

Choose the correct answer from the options given below:

Show Hint

The adjacency matrix representation is a way to depict the structure of a graph, where rows and columns represent nodes, and the values indicate the presence of edges.
Updated On: Feb 17, 2026
  • A - I, B - II, C - III, D - IV
  • A - I, B - III, C - II, D - IV
  • A - I, B - II, C - IV, D - III
  • A - III, B - IV, C - I, D - II
Show Solution

The Correct Option is A

Solution and Explanation


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.

Was this answer helpful?
0

Top Questions on Graph Theory