Vidyalelo
Data Structure · Q136

Graphs

Programming · Data Structure · question 136

Q136

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)
Answer
D.
n*(n+1)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board