Is the adjacency matrix of an undirected simple graph symmetric

Yes, the adjacency matrix of an undirected simple graph is always symmetric. This is because the matrix represents the connections between vertices, and in an undirected graph, the connections between vertices are bidirectional. Therefore, if vertex i is connected to vertex j, then vertex j is also connected to vertex i, and this relationship is reflected in the symmetry of the adjacency matrix.