+1 vote
in Data Structures & Algorithms I by (88.2k points)
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.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...