Route Inspection

Question 0

What is traversable

Answer 0

This is where you are able to travel to all the vertex with out repeating

As all of the vertexes are even

Question 1

When looking at routes you have 3 types if graphs

Answer 1

Traversable
Semi traversable
Not traversable

Question 2

What is semi traversable

Answer 2

A diagram with 2 odd vertex is

As you will start and Finnish at different vertex

Question 3

What is not traversable

Answer 3

This is when more than 2 vetted have odd vertex so you are unable to go to all of the vertex without repeating

Question 4

What is the handshake theorem

Answer 4

This is where you have to add on extra edges so that you can make the route traversable

Question 5

What is the algorithm that is needed to help route inspection

Answer 5

Route inspection

Question 6

When you have to add on edges you need to have these to the pairings

Answer 6

2odd vertex. 1 paring
4odd vertex. 3 pairing
6odd vertex. 15 pairing
8odd vertex. 105 pairing

Question 7

What is the formula for the odd vertex

Answer 7

(n-1)x(n-3)x(n-5)x…..x3x1pairing