735 views
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.

1 Answer

1 votes
1 votes

M = Adjacency Matrix

M= M x M x M ...n times.

M[i][j] = P   means there are P paths of length N from vertex i to vertex j.

Related questions

0 votes
0 votes
2 answers
2
yuuchan asked Jul 22, 2023
478 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉