For the graph 2 e2 e 10 find va four different paths from v

For the graph 2 e2 e. 10 find va) four different paths from v, to v4 b) four different trails from v to v4, none of which are paths c) four different walks from v, to v4, none of which are trails

Solution

(18)

distance between two vertices in a graph is the number of edges in a shortest path

So

(a) = 4

(b) = 2

(c) =1

(d) = 2

-------