New game
Download
Get Academic Plan
Share game
Froggy Jumps
Froggy Jumps

Graph Theory Challenge

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 Challenge

Froggy Jumps

Played 4

About this activity

Test your graph theory skills.

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

Froggy Jumps

Graph Theory ChallengeOnline version

Test your graph theory skills.

by SHIVAM JAVALE
1

In a simple graph, what is the maximum possible degree of a vertex with n vertices?

2

What is a path that visits every vertex exactly once called?

3

What is a spanning tree?

4

For an undirected graph, when does an Euler circuit exist?

5

What is a directed graph where every vertex can reach every other vertex called?

6

Which data structure stores graph connections as (node, list of neighbors)?

7

What cycle uses every edge exactly once?

8

How many edges are needed to connect n vertices in a tree?

9

Which algorithm computes shortest paths from a single source in a weighted graph without negative weights?

10

What graph property indicates a graph has a path between any pair of vertices (undirected)?

Are you sure you want to leave the page?

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