Maintaining a graph in memory by means of its adjacency matrix is known as:

Correct option is D

The method of representing a graph using an adjacency matrix stores information about the presence or absence of edges between vertices in a two-dimensional array. This type of storage technique aligns with the concept of sequential representation, where elements (like matrix rows and columns) are stored in a contiguous memory layout. This representation is particularly efficient for dense graphs and allows quick edge lookup operations through direct indexing. Therefore, using an adjacency matrix for storing graphs corresponds to sequential representation.
Information Booster:
1. Sequential Representation:
· Stores data structures like arrays or matrices in a continuous block of memory.
· In graph representation, an adjacency matrix (2D array) is used to indicate direct connections (edges) between vertices.
· Suitable for dense graphs where most of the possible edges are present.
Additional Knowledge:
· Complete Representation: Not a standard term in graph representation; might imply full edge details, but not an established category.
· Linked Representation: Refers to representing graphs using adjacency lists, where each vertex has a linked list of its adjacent vertices. It is efficient for sparse graphs.
· Circular Representation: This term is generally used in circular linked lists or queues, not in standard graph representation techniques.