COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?
|
|
(n*(n+1))/2
|
|
|
n*(n+1)
|
|
|
(n*(n-1))/2
|
|
|
n*(n-1)
|
Explanation:
Detailed explanation-1: -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.
Detailed explanation-2: -1 Answer. For explanation: Out of n*n possible values for a simple graph the diagonal values will always be zero.
Detailed explanation-3: -The elements of the adjacency matrix will be 0 and 1 when the graphs are simple and there are no weights on the edges or many edges. The diagonal entries of the adjacency matrix will be 0 if there are no self-loops.
There is 1 question to complete.