The adjacency matrix of an undirected graph with 𝑛n vertices has how many entries?A. 𝑛nB. 𝑛2n 2 C. 2𝑛2nD. 𝑛−1n−1

The adjacency matrix of an undirected graph with n vertices is a square matrix of size n x n.

Step 1: Understand that an adjacency matrix is a square matrix. This means the number of rows is equal to the number of columns.

Step 2: In the case of an undirected graph with n vertices, the adjacency matrix will have n rows and n columns because each vertex is connected to every other vertex.

Step 3: To find the total number of entries in the matrix, you multiply the number of rows by the number of columns.

So, the adjacency matrix of an undirected graph with n vertices has n*n = n^2 entries.

Therefore, the correct answer is B. 𝑛^2.