Question: What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?
Options
A : (n*(n-1))/2
B : (n*(n+1))/2
C : n*(n-1)
D : n*(n+1)
Click to view Correct Answer
Data Structure Adjacency Matrix more questions
What symbol is used to Left-justify within the data given....
For every natural number k, which of the following is....
Which of the following relation is correct for rectangular section....
Which of the following relation is correct for design of....
What is the number of edges present in a complete....
If a simple graph G, contains n vertices and m....
The total number of complex multiplications required to compute N....
The total number of complex additions required to compute N....
How many complex additions are required to be performed in....
How many complex multiplications are need to be performed for....
Data Structure Adjacency List more Online Exam Quiz
Dairy Engineering Testing Milk Quality
Data Structure Array Array Operations