mmhjhg

Froggy Jumps

Jugadas 1

Crear copia

Sobre esta actividad

kjnkjlkjtterklkybfte

Creada por

MAJOY

Filipinas

Descarga la versión para jugar en papel

Top 10 resultados

#	Jugador	Acierto	tiempo
1	MAJOY 6 de Febrero de 2026	% 8	01:18

¿Quieres aparecer en el Top 10 de este juego? Inicia sesión para identificarte.

Crea tu propio juego gratis desde nuestro creador de juegos

Compite contra tus amigos para ver quien consigue la mejor puntuación en esta actividad

Crear reto

OPEN UP 6 UNIT 1 VOCABULARY

karen blixen

España

(100)

Repasamos el vocabulario de la unidad
Sabiduría animal

Educaplay Educational Resources

España

(15419)

Conviértete en un genio del Reino Animal
Quiz de Culpa mía película

Yamila Chavez

Argentina

(171)

Demuestra cuánto sabes sobre la película Culpa mía con este divertido quiz.
Salva a la Ranita

Melanie Rodriguez

Estados Unidos

(337)

Contesta las siguientes multiplicaciones correctamente para salvar a la ranita y evitar que caiga al agua, mucha suerte!
El valle de los lobos

Marcos Signes

España

(108)

20 preguntas de este maravilloso libro


Froggy Jumps mmhjhgVersión en línea kjnkjlkjtterklkybfte por MAJOY 1 wjhqkwjdhwelijhbddsj,hwiu a sjdhgusy b c 2 iuwyhjdhusdhuew a dwde b d c ed 3 What is the maximum number of edges in a simple graph with 4 vertices? a 4 b 8 c 6 4 A vertex adjacent to all others in a graph is called a? a Isolated vertex b Universal vertex c Pendant vertex 5 In a tree with n vertices, how many edges are there? a n b 2n-1 c n-1 6 A graph with all vertices degree 2 is a? a Cycle b Tree c Path 7 Which graph contains no cycles? a Acyclic graph b Complete graph c Cyclic graph 8 The sum of degrees of all vertices in any graph equals? a Twice the number of edges b The number of edges c Number of vertices 9 A graph is connected if there is a path between every pair of? a Faces b Edges c Vertices 10 Two graphs are isomorphic if they have the same... a Coloring arrangement b Structure with relabeled vertices c Number of vertices only 11 In a directed graph, a path that starts and ends at the same vertex is a? a Directed path b Directed cycle c Euler path 12 A bipartite graph has a maximum length of a path of how many colors? a 4-colorable b 2-colorable c 3-colorable

Froggy Jumps

mmhjhgVersión en línea

kjnkjlkjtterklkybfte

por MAJOY

wjhqkwjdhwelijhbddsj,hwiu

sjdhgusy

iuwyhjdhusdhuew

dwde

What is the maximum number of edges in a simple graph with 4 vertices?

A vertex adjacent to all others in a graph is called a?

Isolated vertex

Universal vertex

Pendant vertex

In a tree with n vertices, how many edges are there?

2n-1

n-1

A graph with all vertices degree 2 is a?

Cycle

Tree

Path

Which graph contains no cycles?

Acyclic graph

Complete graph

Cyclic graph

The sum of degrees of all vertices in any graph equals?

Twice the number of edges

The number of edges

Number of vertices

A graph is connected if there is a path between every pair of?

Faces

Edges

Vertices

Two graphs are isomorphic if they have the same...

Coloring arrangement

Structure with relabeled vertices

Number of vertices only

In a directed graph, a path that starts and ends at the same vertex is a?

Directed path

Directed cycle

Euler path

A bipartite graph has a maximum length of a path of how many colors?

4-colorable

2-colorable

3-colorable

Puedes integrar el juego en un LMS compatible con LTI 1.1 o LTI 1.3 como Canvas, Moodle, o Blackboard. De esta manera podrás guardar las puntuaciones automáticamente en el libro de calificaciones de esa plataforma.

mmhjhg

Froggy Jumps

Sobre esta actividad

Creada por

Descarga la versión para jugar en papel

Top juegos

Froggy Jumps

OPEN UP 6 UNIT 1 VOCABULARY

Froggy Jumps

Sabiduría animal

Froggy Jumps

Quiz de Culpa mía película

Froggy Jumps

Salva a la Ranita

Froggy Jumps

El valle de los lobos

Froggy Jumps

mmhjhgVersión en línea

por MAJOY

wjhqkwjdhwelijhbddsj,hwiu

iuwyhjdhusdhuew

What is the maximum number of edges in a simple graph with 4 vertices?

A vertex adjacent to all others in a graph is called a?

In a tree with n vertices, how many edges are there?

A graph with all vertices degree 2 is a?

Which graph contains no cycles?

The sum of degrees of all vertices in any graph equals?

A graph is connected if there is a path between every pair of?

Two graphs are isomorphic if they have the same...

In a directed graph, a path that starts and ends at the same vertex is a?

A bipartite graph has a maximum length of a path of how many colors?

		%
	Anónimo	%
		%
		%