What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?Group of answer choicesn*(n-1)(n*(n-1))/2(n*(n+1))/2n*(n+1)

The maximum number of possible non-zero values in an adjacency matrix of a simple graph with n vertices is n*(n-1).

Here's why:

In a simple graph, there are no loops or multiple edges. Therefore, each vertex can be connected to every other vertex.

An adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.

In an adjacency matrix of a simple graph with n vertices, each row (or column) represents a vertex in the graph.

Since there are no loops, there are no connections from a vertex to itself. Therefore, each vertex can be connected to n-1 other vertices.

Since there are n