Graph Theory Vocabulary

Graph Theory Vocabulary

12th Grade

9 Qs

quiz-placeholder

Similar activities

Euler circuit review

Euler circuit review

11th - 12th Grade

14 Qs

Euler Circuits and Paths

Euler Circuits and Paths

10th - 12th Grade

13 Qs

Hamilton Circuit Review

Hamilton Circuit Review

11th - 12th Grade

7 Qs

Discrete Math Final Exam Review: Graph Theory

Discrete Math Final Exam Review: Graph Theory

9th - 12th Grade

10 Qs

Discrete Math Graphs

Discrete Math Graphs

9th - 12th Grade

13 Qs

Networks revision

Networks revision

12th Grade

10 Qs

HW: Unit 6 Graph Theory Lesson 2

HW: Unit 6 Graph Theory Lesson 2

12th Grade

8 Qs

Graph Theory Test

Graph Theory Test

9th - 12th Grade

12 Qs

Graph Theory Vocabulary

Graph Theory Vocabulary

Assessment

Quiz

Mathematics

12th Grade

Medium

CCSS
HSG.CO.A.1, HSA.REI.D.10, HSG.CO.C.10

Standards-aligned

Created by

Joni Hutcherson

Used 23+ times

FREE Resource

9 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What are the dots in a graph called?

Vertices

Edges

Euler Circuits

Euler Paths

Tags

CCSS.HSG.CO.A.1

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What are the lines in a graph called?

Vertices

Edges

Euler Circuits

Euler Paths

Tags

CCSS.HSA.REI.D.10

CCSS.HSG.CO.A.1

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is is called when you can go through every edge on a graph exactly once?

Euler Circuit

Euler Path

Connected Graph

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is is called when you can go through every edge on a graph exactly once and end back where you started?

Euler Circuit

Euler Path

Connected Graph

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the degree of vertex A?

1

2

3

4

Tags

CCSS.HSG.CO.A.1

CCSS.HSG.CO.C.10

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the degree of vertex E?

1

2

3

4

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Does this graph have an Euler Circuit?

Yes

No

8.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Does this graph have an Euler Path?

Yes

No

9.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

You can tell a graph has an Euler Circuit if it has no vertices with an ___________ degree.

Odd

Even