Decision- Graphs Key Words

finite sequence of edges so end of one vertex is start of next

walk where no vertex is visited more than once

walk where no edge is visited more than once

walk where each vertex is visited at least once, and starts and ends at the same vertex

start and end vertex are the same, no vertex is visited more than once

tour where vertex each is visited exactly once

sum of degrees of vertices = 2 x number of edges

all vertices in graph are of even degree

has exactly two nodes of odd degree

connected graph with no cycles

a subgraph which includes all vertices and is a tree

every vertex is connected to every other vertex by a single edge e.g. K5

graphs which are drawn differently but have the same info

a graph that can be drawn in a plane such that no edges meet except at a vertex