Question

What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

(a) (n*(n-1))/2

(b) (n*(n+1))/2

(c) n*(n-1)

(d) n*(n+1)

Query is from Adjacency Matrix in section Graph of Data Structures & Algorithms I

I had been asked this question in examination.

Answer 1

Correct option is (c) n*(n-1)

For explanation: Out of n*n possible values for a simple graph the diagonal values will always be zero.