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 Alphabet

Alphabet

Played 0

About this activity

Guess a graph term for every letter from A to Z.

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 Alphabet
 

Graph Theory AlphabetOnline version

Guess a graph term for every letter from A to Z.

by GLORY C SCHOOL OF SCIENCES (NCR)
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z

Starts with A

Relation between two vertices connected by an edge.

Starts with B

Edge whose removal increases the number of connected components.

Starts with C

Closed path where no vertex is repeated except start and end.

Starts with D

Count of edges incident to a vertex.

Starts with E

Connection between two vertices.

Starts with F

A graph with no cycles.

Starts with G

A set of vertices joined by edges.

Starts with H

Vertex connected to many others acting as central point.

Starts with I

One-to-one mapping between two graphs that preserves connections.

Starts with J

Vertex where several edges meet.

Starts with K

Subset of vertices with certain reachability properties in directed graphs.

Starts with L

Edge that starts and ends at the same vertex.

Starts with M

Set of pairwise non-adjacent edges.

Starts with N

Point in a graph representing an object.

Starts with O

Assignment of directions to the edges of an undirected graph.

Starts with P

Sequence of vertices connected by edges with no vertex repeated.

Starts with Q

Cycle consisting of four vertices.

Starts with R

Cycle, especially a loop that returns to start.

Starts with S

Graph formed from a subset of vertices and edges of another graph.

Starts with T

Connected acyclic graph.

Starts with U

Graph where edges have no direction.

Starts with V

Point in a graph where edges meet.

Starts with W

Sequence of vertices and edges allowing repeats.

Starts with X

Graph notation used to describe structures in some literature.

Starts with Y

Formation where a vertex branches into multiple paths.

Starts with Z

Path that changes direction at consecutive vertices.

Are you sure you want to leave the page?

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