New game
Download
Get Academic Plan
Share game
Fill in the Blanks
Fill in the Blanks

Network definitions

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:

Network definitions

Fill in the Blanks

Played 0

About this activity

Fill in the blanks

Created by

Australia

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
Network definitions
 

Fill in the Blanks

Network definitionsOnline version

Fill in the blanks

by Erin
1

The lines connecting two vertices is called an .

A is an object or place represented by a dot .

The number of edges attached to the vertex are the .

A is an edge connecting a vertex to itself .

Two or more edges that connect the same two vertices are .

An edge drawn on a graph to make a connected graph is a .

Graphs that have the same number of edges and vertices , with the same connections are .

Every vertex is connected to another vertex either directly or via another vertex are .

are the regions of a planar graph .

A connected graph with no edges crossing over is .

A is a graph that contains no loops or edges .

A is a graph that is simple and also has every vertex connected directly to every other vertex .

A is a graph that contains some parts or elements of an original graph .

A matrix that shows the connections between the vertices is an .

Are you sure you want to leave the page?

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