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:

Graph Theory Unscramble Challenge

Unscramble Letters

Played 1

About this activity

Test your knowledge of discrete structures by unscrambling key terms from the world of graph theory.

Created by

Philippines

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
Graph Theory Unscramble Challenge
 

Unscramble Letters

Graph Theory Unscramble ChallengeOnline version

Test your knowledge of discrete structures by unscrambling key terms from the world of graph theory.

by Patricia Medrano
1

2

A fundamental unit in a graph representing a point where edges meet.

3

A connection between two vertices in a graph, representing a relationship.

4

A sequence of edges that connects a series of vertices without revisiting any.

5

A path that starts and ends at the same vertex without repeating any edges.

6

A collection of vertices and edges that represent pairwise relationships among objects.

7

The number of edges incident to a vertex, indicating its connectivity.

8

A property of a graph where there is a path between every pair of vertices.

9

A portion of a graph formed by a subset of its vertices and edges.

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.