edited by
3,652 views

2 Answers

Best answer
8 votes
8 votes

Answer :  all Zeros

It is not said that how many node should be there in graph take a graph with single node And it is also mentioned that there is no loop .

selected by
1 votes
1 votes

Consider 5X5 matrix, for 1,1 for 2,2, since there is no self loop so all diagonal will be 0 

0        
  0      
    0    
      0  
        0
Answer:

Related questions

8 votes
8 votes
2 answers
1
go_editor asked Jun 10, 2016
3,941 views
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is$1$$k$$k-1$$k/2$
11 votes
11 votes
2 answers
2
go_editor asked Jun 10, 2016
2,806 views
A graph with $n$ vertices and $n-1$ edges that is not a tree, isConnectedDisconnectedEulerA circuit
13 votes
13 votes
3 answers
3
go_editor asked Jun 10, 2016
5,097 views
Djikstra’s algorithm is used toCreate LSAsFlood an internet with informationCalculate the routing tablesCreate a link state database
5 votes
5 votes
3 answers
4
go_editor asked Jun 10, 2016
4,892 views
Which of the following models used for software reliabilityWaterfallMusaCOCOMORayleigh