Discrete HW Lesson 32 on 4.1 to 4.4 Graph Theory

One of the requirements to have an Euler Circuit is to have a connected graph. What is the other requirement?

• No even degree vertices.

• No more than 2 even degree vertices.

• No odd degree vertices.

• No more than two odd degree vertices.

One of the requirements to have an Euler Path is to have a connected graph. What is the other requirement?

• No even degree vertices.

• No more than 2 even degree vertices.

• No odd degree vertices.

• No more than two odd degree vertices.

Will this graph have an Euler Circuit? Why or why not?

• Yes. All vertices are even.

• No. All vertices are even.

• Yes. There are two odd vertices.

• No. There are two odd vertices.

State the number of vertices.

• 14

• 3.5

• 7

• 5

Tags

CCSS.6.G.A.4

Choose the correct term to match each definition: Lines or curves that connect vertices.

• Regions

• Vertices

• Edges

• Paths

Tags

CCSS.HSG.CO.A.1

An edge that begins and ends at the same vertex.

• Multiple edges

• Vertices

• Loop

• Node

The diagram shows a network. Find the degree of vertex B.

• 4

• 5

• 6

• 7

Choose all vertices that are adjacent to vertex A

• B

• C

• D

• E

Which of the following is not a path from D to A?

• DCA

• DEDCCA

• DCCA

• DECDA

• All of the above are paths from D to A

Which of the following is not a CIRCUIT in the graph?

• ADCDEDA

• CADC

• EDCCE

• ADECA

• All of the above are circuits