Decision Maths Chapter 2

What is a route through the graph which no edge is visited more than once?

• Trail

• Walk

• Path

• Cycle

A ____ is a route through a graph along the edges

Which is not a word used to describe the number of edges incident to a vertext?

• Valency

• Degree

• Power

• Order

A ____ is a walk which no vertex is visited more than once.

Which is an example of a cycle using this graph?

Select all that apply.

• RSUWVU

• RSUR

• RSVUSR

• RSVWTR

A __________ cycle is a cycle that includes every vertex.

Which of the these graphs are trees?

Select all that apply.

• A

• B

• C

• D

A ____ is an edge that starts and finishes at the same vertex.

Which graph is isomorphic to the one above?

Select all that apply.

• 
• 
• 

Other word for a directed graph is a _______