1) Sum of degrees of all vertices a) visits all edges exactly once b) an even number of vertices with an odd degree. c) = 2 * size d) visits all edges exactly once and starts and ends at the same vertex. 2) Simple graph has a) visits all edges exactly once b) visits all edges exactly once and starts and ends at the same vertex. c) only if there are 0 vertices with an odd degree. d) an even number of vertices with an odd degree. 3) Eulerian path a) visits all edges exactly once and starts and ends at the same vertex. b) visits all edges exactly once c) an even number of vertices with an odd degree. d) = 2 * size 4) Eulerian cycle a) an even number of vertices with an odd degree. b) visits all edges exactly once c) = 2 * size d) visits all edges exactly once and starts and ends at the same vertex. 5) Eulerian path exists a) only if there are 2 vertices with an odd degree. b) visits all edges exactly once and starts and ends at the same vertex. c) an even number of vertices with an odd degree. d) = 2 * size 6) Eulerian cycle exists a) visits all edges exactly once b) an even number of vertices with an odd degree. c) only if there are 2 vertices with an odd degree. d) only if there are 0 vertices with an odd degree.

Eulerian graphs

per en/la
Imprimir
Incrustar

Tauler de classificació

Estil visual

Opcions

Canvia de fonament

Restaurar desada automàtica: ?