The adjacency matrix for an undirected graph is symmetrical.

Name: The adjacency matrix for an undirected graph is symmetrical.
Brand: Quizplus
Rating: 4.8 (35 reviews)

Question

Quizplus · Accepted Answer

In an undirected graph, if there is an edge from vertex A to vertex B, there is also an edge from vertex B to vertex A. This means that the adjacency matrix, which shows the connections between vertices, will be symmetric. The entry in row i and column j will be the same as the entry in row j and column i. Therefore, the statement is true.

The Adjacency Matrix for an Undirected Graph Is Symmetrical