Solution

The correct answer is Sequential Representation

Key Points

• Adjacency Matrix: ✅ An adjacency matrix is a way of representing a graph in memory using a 2D array where rows and columns correspond to graph vertices. The value at cell (i, j) indicates whether an edge exists between vertex i and vertex j.
• Complete Representation: ❌ This term generally refers to graphs where all pairs of vertices are connected by edges, but it is not associated with adjacency matrix storage.
• Linked Representation: ❌ Linked representation uses adjacency lists, not adjacency matrices, to store graph information.
• Circular Representation: ❌ This is not a standard term in graph representation and does not apply to adjacency matrices.
• Sequential Representation: ✅ Sequential representation refers to the method of storing a graph in memory using an adjacency matrix, as it uses a sequential data structure (array).

Additional Information

• Space Complexity: An adjacency matrix requires O(V²) space, where V is the number of vertices in the graph. This is suitable for dense graphs but inefficient for sparse graphs.
• Time Complexity: Checking the presence of an edge between two vertices takes O(1) time using an adjacency matrix.
• Usage: Adjacency matrices are commonly used for dense graphs or when fast edge queries are required.

Hence, the correct answer is: option 4) Sequential Representation