New game
Download
Get Academic Plan
Share game
Integrate it into your platform

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.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Graphs Essentials Quiz

Quiz

Played 0

About this activity

Fundamentals of graphs

Created by

India

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Graphs Essentials Quiz
 

Graphs Essentials QuizOnline version

Fundamentals of graphs

by Dhanushree3016 Dhanushree
1

What is a simple graph?

2

In a complete graph K_n, how many edges are there?

3

What distinguishes a multigraph from a simple graph?

4

What is a loop in a graph?

5

What is the degree of a vertex in a graph with a loop attached?

6

Which graph type allows multiple edges but no restrictions on loops?

7

In an undirected graph, what does the path length count?

8

What is a Hamiltonian path?

9

What is a spanning tree of a connected graph?

10

If a graph has n vertices and is complete, how many edges does it have?

Feedback

A simple graph has at most one edge between any two vertices and no edge from a vertex to itself.

K_n has every pair of distinct vertices connected by a unique edge.

Multigraphs allow parallel edges; simple graphs do not.

A loop starts and ends at the same vertex.

A loop contributes 2 to the degree of its vertex.

A multigraph permits parallel edges; loops are optional depending on definition.

Path length is measured by edges traversed along the route.

Hamiltonian path traverses all vertices once without repetition.

Spanning tree connects all vertices with no cycles.

Complete graphs connect every pair of distinct vertices.

Are you sure you want to leave the page?

If you leave, you will lose the game in progress.