Skip to Content

Build your own quiz

14 questions

Show Answers

See Preview

- Multiple ChoicePlease save your changes before editing any questions.
What is the chromatic number of the tree?

7

6

2

1

- Multiple ChoicePlease save your changes before editing any questions.
Which set represents the vertices of the graph?

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}

{1, 2, 3, 4, 5, 6,}

{1, 2, 3, 4, 5, 6, 7}

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

- Multiple ChoicePlease save your changes before editing any questions.
What is the degree of vertex 4?

3

4

5

7

- Multiple ChoicePlease save your changes before editing any questions.
Which two vertices are adjacent vertices?

5 is adjacent to 6

3 is adjacent to 6

4 is adjacent to 1

3 is adjacent to 2

- Multiple ChoicePlease save your changes before editing any questions.
Which Theorem is represented by the map presented?

Kruskal's Theorem

Four Color Theorem

Prim's Theorem

Coloring is fun!

- Multiple ChoicePlease save your changes before editing any questions.
Which vocabulary term is illustrated through the diagram?

Minimal Spanning Tree

Four Color Theorem

Cycle

Vertices

- Multiple ChoicePlease save your changes before editing any questions.
The graph represents the following vocabulary term.

Cycle

Path

Complete Graph

Complete Bipartite Graph

- Multiple ChoicePlease save your changes before editing any questions.
The graph is an example of a

Path

Cycle

Complete Bipartite Graph

Complete Graph

- Multiple ChoicePlease save your changes before editing any questions.
Which vocabulary term describes the graph?

circuit

path

complete graph

polygon

- Multiple ChoicePlease save your changes before editing any questions.
Which vertices are adjacent to E?

B and C

B, C, D, and A

B

A, B, C, D, F, G

- Multiple ChoicePlease save your changes before editing any questions.
Which of the following are isolated vertices?

F

G

Graphs are fun.

F and G

- Multiple ChoicePlease save your changes before editing any questions.
Which describes the edges of the graph?

{A,B}, {A,C}, {A, E}, {B,C}, {B,E}

A, B, C, D, E

{A,B}, {A,C}, {A, E}, {B,C}, {B,E}, {C,D}

{A,B}, {A,C}, {A, E}

- Multiple ChoicePlease save your changes before editing any questions.
Which notation is correct for the complete bipartite graph?

K

_{2,3}K

_{3}K

_{2}K

_{1, 3} - Multiple ChoicePlease save your changes before editing any questions.
The degree of a vertex in a graph is

number of vertices in the graph

number of edges in the graph

number of edges incident on that vertex

always an even number