How many paths are there from vertex 1 to vertex 5 of length?
Answers
Answered by
0
Step-by-step explanation:
If a graph has 5 vertices then within vertex 1 to vertex 5 there will be 4 edges.
As we know that if a graph has v number of vertices the it will has v-1 number of directed edges.
Therefore for this problem it will be 5-1 or 4 edges.
Therefore we can say that the maximum number of edges between then can be v * (v-1) = 20
thank you follow me
Similar questions