New game
Download
Get Academic Plan
Share game
Yes or No
Yes or No

Teoria de grafos

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:

Teoria de grafos

Yes or No

Played 6

About this activity

Verdadero o Falso sobre teoría 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
Teoria de grafos
 

Teoria de grafosOnline version

Verdadero o Falso sobre teoría de grafos.

by Sharim
1

¿La matriz de adyacencia muestra con 1/0 si dos vértices están conectados?

2

¿En grafos dirigidos la matriz de adyacencia puede no ser simétrica?

3

¿Una arista es la conexión entre dos vértices?

4

¿La ruta más corta siempre es la que pasa por menos vértices?

5

¿En teoría de grafos, “nodo” y “vértice” significan lo mismo?

6

¿La matriz de incidencias relaciona vértices con aristas indicando cuáles están conectados?

7

¿El algoritmo de Dijkstra (camino mas corto) se usa para rutas más cortas con pesos (distancias) positivos?

8

¿Un 0 en la diagonal de la matriz indica que un nodo no tiene bucle consigo mismo?

9

Un nodo no se puede conectar consigo mismo.

10

¿La matriz de adyacencia de un grafo no dirigido siempre es simétrica (matriz identidad)?

Are you sure you want to leave the page?

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