Discrete Math Given the following graph select all paths tha

Discrete Math

Given the following graph, select all paths that are valid from vertex A to vertex C. A-C A-D-B-C A-D-B-E-C A-B-C

Solution

the following are the possible paths from vertex A to vertex C for the given non-directional graph

1)A->B->C

2)A->B->E->C

3)A->D->B->C

4)A->D->B->E->C