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:

Quiz de Teoría de Grafos

Yes or No

Played 0

About this activity

Desafío corto de grafos

Created by

Mexico

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
Quiz de Teoría de Grafos
 

Quiz de Teoría de GrafosOnline version

Desafío corto de grafos

by Norberto Irineo
1

Un ciclo puede existir en un grafo si es acíclico.

2

La conectividad de un grafo solo se define para grafos no dirigidos.

3

Un grafo es un conjunto de vértices y aristas que los conectan.

4

En un grafo dirigido, la dirección de las aristas no importa para la noción de camino.

5

El grado de un vértice es el número de aristas incidentes.

6

Un grafo puede ser dirigido o no dirigido.

7

DFS siempre visita todos los vértices de un grafo no conexo sin reiniciar.

8

En un grafo completo no dirigido con n vértices hay n^2/2 aristas.

9

Un árbol es un grafo conexo sin ciclos.

10

Un camino simple no repite vértices.

Are you sure you want to leave the page?

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