Question

# Let G be the graph having 3 vertices A, B and C. There are five edges...

Let G be the graph having 3 vertices A, B and C. There are five edges connecting A and B and three edges connecting B and C. Solve the following:

1) Determine the number of paths from A to B

2) Determine the number of different trails of length 6 from A to B

1. A Path in a graph is a sequence of edges which joins a sequence of vertices that are all distinct. Here there are 5 edges connecting A and B. Ths there are 5 paths from A to B.

2. A Walk in which no edge is repeated then we get a trail. Vertex can be repeated. Here edges not repeat. Thus the number of trails of length 6 are:

4 edges between A and B are chosen and the remaining 2 between B and C are chosen.

If the edges are distinct.

case(1): A-B-A-B-C-B: number of trails= 5*4*3*2*3*2=720

case(2): A-B-C-B-A-B: number of trails= 5*4*3*2*3*2= 720

Thus total number of trails is 1440.

If the edges are not distinct:

#### Earn Coins

Coins can be redeemed for fabulous gifts.