Ayúdanos a dar forma a GoConqr. ¿Qué deberíamos añadir?

Test

Graph Theory

Lezwon Castellino 10 preguntas

Hacer el test

Preguntas del test (10)

  1. 1"All cycle' s are paths, but not all paths are cycles"
    1. ATrue
    2. BFalse
  2. 2Adjacency Matrix = A(i,j) where i and j are vertex's. Incidence Matrix = A(i,j) where ... ?
    1. Ai is a vertex and j is an edge
    2. Bj is a vertex and i is an edge
    3. Ci and j are edge's
  3. 3Two graphs are isomorphic is there is a _________________________ berween them.
    1. AInjection
    2. BSubjection
    3. CBijection
  4. 4A spanning subgraph is a graph..
    1. Awhich contains every vertex of G
    2. Bwhich has the same edges as G
    3. Cwhich has at least two vertices with a degree of 3
  5. 5A tree is a connected cyclic graph
    1. AVerdadero
    2. BFalso
  6. 6A Eulerian walk contains
    1. Aequal number of odd and even vertices
    2. Ball odd degree vertices
    3. Ceither 0 or exactly 2 vertices of odd degree
  7. 7A hamilton path is a path which
    1. Awhich connects back to the starting node
    2. Bwhich connects every node in graph G to the rest
    3. Ctraverses every edge in graph G exactly once
    4. Dtraverses every node in graph G exactly once
  8. 8A geodesic is the shortest path to a given node on a Graph G
    1. AVerdadero
    2. BFalso
  9. 9A Graph can have more than one Sink
    1. AVerdadero
    2. BFalso
  10. 10Which of the following is a hamilton path?
    1. AImagen de la opción A
    2. BImagen de la opción B
    3. CImagen de la opción C
    4. DImagen de la opción D

Información

Descripción
Beginner Mathematics Test sobre Graph Theory, creado por Lezwon Castellino el 29/02/2016.
Idioma
English
Visitas
2
Etiquetas
mathematicsbeginner
Valoración
Aún sin valoraciones
Valora este test
Valora este test

Escríbenos

¿Sobre qué es tu mensaje?

¿Qué deberíamos añadir?