## Consider the graph adjacency matrix

1 2 3 4 5

1 010 1 0

20 0 1 1 1

3 1 0 0 0 0

4001 00

50 010 1 0

How many paths are there from vertex 1 to vertex 5 of length either 1 edge or 2 edges or 3

edges or 4 edges?

a) 2

b) 3

c) 4

d) 5

Skip to content
# Consider the graph adjacency matrix
1 2 3 4 51 010 1 020 0 1 1 13 1 0 0 0 04001 0050

##
Consider the graph adjacency matrix

##

1 2 3 4 5

1 010 1 0

20 0 1 1 1

3 1 0 0 0 0

4001 00

50 010 1 0

How many paths are there from vertex 1 to vertex 5 of length either 1 edge or 2 edges or 3

edges or 4 edges?

a) 2

b) 3

c) 4

d) 5