0 votes 0 votes If I have any complete graph given then what is the approach to be followed up for calculating the number of paths of length n because for large value of n ,computation would be tricky ,so how to proceed with such questions. angel rajput asked Feb 15, 2015 angel rajput 735 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes M = Adjacency Matrix MN = M x M x M ...n times. MN [i][j] = P means there are P paths of length N from vertex i to vertex j. sameer2009 answered Feb 17, 2015 sameer2009 comment Share Follow See all 0 reply Please log in or register to add a comment.