Graph Theory HW

Find the number of different cycles contained in the directed graph with vertices {A,B,C,D,E} and edges {AB,BA,BC,CD,DC,DB,DE} *

0 points

1

2

3

4

given the adjacency matrix

{0 1 1 1 1

1 0 1 1 0

0 1 1 1 1

1 1 1 0 0

1 0 1 1 0}

which vertices has the greatest number of paths of length 1 and 2 from itself?

0 points

A

B

C

D

E

Extra things to know

I would also recommend learning how to draw graphs using adjacency matrices and vertex-edge notations. I cannot give those problems on google forms.

There are some practice problems here