REeview for GRaph Theory Exam April

• 2

• 6

• 8

• 12

• 0

• 1

• 2

• 3

A caterpillar has 15 edges. What is its order?

• 15

• 16

TRUE or FALSE: Every path is a trail.

• TRUE

• FALSE

• TRUE

• FALSE

TRUE or FALSE: If a graph contains a u-v walk of length k, then it contains a u-v path of length at most k.

• TRUE

• FALSE

• TRUE

• FALSE

• { b, f, g, d }

• { a, f, c }

• { f, c }

• { b, f, c, g, d }

• { b, f, g, d }

• { a, h, e }

• { a, b, f, h }

• 4

• 14

• 6

• It is impossible to determine.