Quiz: Graphs in Mathematics


Graphs in MathematicsOnline version Test your graph theory knowledge. by MAJOY 1 In a graph, what is a vertex? a A type of edge b A point where edges meet c A line segment d A closed loop 2 What is an edge in graph terms? a A vertex's boundary b A path with no vertices c A loop at a vertex d A connection between two vertices 3 A graph with no cycles is called what? a A bipartite graph b A complete graph c A cycle graph d A tree 4 Which graph is bipartite? a A graph whose vertices can be colored with two colors b A graph with a triangle c A complete graph of four nodes d A single vertex graph 5 What does a Hamiltonian path do? a Visits every vertex exactly once b Starts and ends at the same vertex c Uses every color exactly once d Visits every edge exactly once 6 What is a planar graph? a A graph with no vertices b A graph with only cycles c A graph drawable in the plane without edge crossings d A graph with parallel edges 7 Dijkstra's algorithm computes what? a Minimum spanning tree b Number of cycles in the graph c Shortest path from a source to all vertices d Longest path in a graph 8 What is a degree of a vertex? a Color count of the vertex b Number of vertices in the graph c Length of the vertex d Number of edges incident to it 9 Which graph property is shown by a complete graph K_n? a Exactly two edges per vertex b Every pair of distinct vertices is connected c No edges exist d All cycles have even length 10 What is an adjacency matrix used for? a Representing which vertices are connected b Listing all paths c Counting the graph's cycles d Measuring graph colorability

1

In a graph, what is a vertex?

a

A type of edge

b

A point where edges meet

c

A line segment

d

A closed loop

2

What is an edge in graph terms?

a

A vertex's boundary

b

A path with no vertices

c

A loop at a vertex

d

A connection between two vertices

3

A graph with no cycles is called what?

a

A bipartite graph

b

A complete graph

c

A cycle graph

d

A tree

4

Which graph is bipartite?

a

A graph whose vertices can be colored with two colors

b

A graph with a triangle

c

A complete graph of four nodes

d

A single vertex graph

5

What does a Hamiltonian path do?

a

Visits every vertex exactly once

b

Starts and ends at the same vertex

c

Uses every color exactly once

d

Visits every edge exactly once

6

What is a planar graph?

a

A graph with no vertices

b

A graph with only cycles

c

A graph drawable in the plane without edge crossings

d

A graph with parallel edges

7

Dijkstra's algorithm computes what?

a

Minimum spanning tree

b

Number of cycles in the graph

c

Shortest path from a source to all vertices

d

Longest path in a graph

8

What is a degree of a vertex?

a

Color count of the vertex

b

Number of vertices in the graph

c

Length of the vertex

d

Number of edges incident to it

9

Which graph property is shown by a complete graph K_n?

a

Exactly two edges per vertex

b

Every pair of distinct vertices is connected

c

No edges exist

d

All cycles have even length

10

What is an adjacency matrix used for?

a

Representing which vertices are connected

b

Listing all paths

c

Counting the graph's cycles

d

Measuring graph colorability

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.

Graphs in Mathematics

Quiz

About this activity

Created by

Download the paper version to play

Top Games

Quiz

Photosynthesis vs Cellular Respiration - Practice Quiz

Quiz

Spanish Alphabet Listening

Quiz

Practice Quiz - Punnett Square, Variation, and Mutations

Quiz

UPS 5 Seeing Habits Quiz

Quiz

Tissues - Practice Quiz

Graphs in MathematicsOnline version

by MAJOY

In a graph, what is a vertex?

What is an edge in graph terms?

A graph with no cycles is called what?

Which graph is bipartite?

What does a Hamiltonian path do?

What is a planar graph?

Dijkstra's algorithm computes what?

What is a degree of a vertex?

Which graph property is shown by a complete graph K_n?

What is an adjacency matrix used for?

		%
	Anonymous	%
		%
		%