Graph Theory Vocabulary

Graph Theory Vocabulary

12th Grade

9 Qs

quiz-placeholder

Similar activities

Math 45 Final Exam

Math 45 Final Exam

9th Grade - University

9 Qs

Discrete Math Final Exam Review: Graph Theory

Discrete Math Final Exam Review: Graph Theory

9th - 12th Grade

10 Qs

12 General -  13A  Graphs and Networks

12 General - 13A Graphs and Networks

12th Grade

12 Qs

Graph Theory

Graph Theory

12th Grade - University

13 Qs

AMDM - Unit 4 Test Part I

AMDM - Unit 4 Test Part I

12th Grade

14 Qs

12 General Unit 4 Topic 2 2020

12 General Unit 4 Topic 2 2020

12th Grade

10 Qs

Graph Theory

Graph Theory

9th - 12th Grade

13 Qs

Graph Theory: Euler

Graph Theory: Euler

11th - 12th Grade

10 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