Math

Question 1

Closed

Answer 1

Must start and end at the same vertex

Question 1

Walk

Answer 1

Any route taken through a network, including routes that repeat edges and vertices

Question 2

Trail

Answer 2

A walk in which no edges are repeated

Question 3

Cycle

Answer 3

A path beginning and ending at the same vertex

Question 4

Closed Trail

Answer 4

A trail beginning and ending at the same vertex

Question 5

Path

Answer 5

A walk in which no vertices are repeated, except possible the start and finish

Question 6

Eulerian Graph

Answer 6

Is a connected graph which start at a vertex and travels each edge only and return to the vertex from which you started

Question 7

Semi-Eulerian Graph

Answer 7

A connected graph which allows you to start at a vertex and travels each edge once without returning to the start

Question 8

Hamiltonian Graph

Answer 8

A graph that has a path that includes every vertex exactly once, while ending at the initial vertex

Question 9

Semi-Hamiltonian

Answer 9

A graph that includes every vertex exactly once but ends at a vertex other than starting one