- Thread starter
- #1

#### Joystar1977

##### Active member

- Jul 24, 2013

- 119

F.) How many walks of length 2 are there in graph K5? Explain.

Is this correct as follows for the walks of length 2?

K squared (2) = K x K =

0, 1, 0, 1, 0

1, 0, 1, 0, 0

0, 1, 0, 1, 1

1, 0, 1, 0, 1

0, 0, 1, 1, 0

x

0, 1, 0, 1, 0

1, 0, 1, 0, 0

0, 1, 0, 1, 1

1, 0, 1, 0, 1

0, 0, 1, 1, 0

=

1, 0, 1, 0, 1

0, 1, 0, 1, 1

1, 0, 1, 1, 1

0, 1, 1, 1, 1

1, 1, 1, 1, 1

Is it true that in this problem, I would let the maximum walks of length k be 5 and the maximum number of nodes be 10.